TSTP Solution File: ITP216^3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP216^3 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 22:16:59 EDT 2024
% Result : Theorem 1.02s 1.36s
% Output : CNFRefutation 1.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of formulae : 22 ( 9 unt; 10 typ; 0 def)
% Number of atoms : 19 ( 10 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 52 ( 8 ~; 3 |; 1 &; 39 @)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 16 ( 2 ^ 14 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
heap_T6362127782908069795rray_a: $tType ).
thf(decl_sort2,type,
list_a: $tType ).
thf(decl_sort3,type,
heap_e7401611519738050253t_unit: $tType ).
thf(decl_sort4,type,
option3216581401566546698it_nat: $tType ).
thf(decl_28,type,
array_of_list_a: list_a > heap_T6362127782908069795rray_a ).
thf(decl_1006,type,
heap_T5591663578999710211rray_a: heap_T6362127782908069795rray_a > heap_e7401611519738050253t_unit > option3216581401566546698it_nat ).
thf(decl_1016,type,
heap_T6932021131025641745rray_a: heap_T6362127782908069795rray_a > heap_e7401611519738050253t_unit > $o ).
thf(decl_1299,type,
none_P2587165478634041381it_nat: option3216581401566546698it_nat ).
thf(decl_2591,type,
h: heap_e7401611519738050253t_unit ).
thf(decl_2592,type,
xs: list_a ).
thf(fact_12_success__def,axiom,
( heap_T6932021131025641745rray_a
= ( ^ [X20: heap_T6362127782908069795rray_a,X2: heap_e7401611519738050253t_unit] :
( ( heap_T5591663578999710211rray_a @ X20 @ X2 )
!= none_P2587165478634041381it_nat ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_12_success__def) ).
thf(fact_45_success__of__listI,axiom,
! [X70: list_a,X12: heap_e7401611519738050253t_unit] : ( heap_T6932021131025641745rray_a @ ( array_of_list_a @ X70 ) @ X12 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_45_success__of__listI) ).
thf(conj_0,conjecture,
( ( heap_T5591663578999710211rray_a @ ( array_of_list_a @ xs ) @ h )
!= none_P2587165478634041381it_nat ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(c_0_3,plain,
! [X18944: heap_T6362127782908069795rray_a,X18945: heap_e7401611519738050253t_unit] :
( ( heap_T6932021131025641745rray_a @ X18944 @ X18945 )
<=> ( ( heap_T5591663578999710211rray_a @ X18944 @ X18945 )
!= none_P2587165478634041381it_nat ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_12_success__def])])]) ).
thf(c_0_4,plain,
! [X18953: heap_T6362127782908069795rray_a,X18954: heap_e7401611519738050253t_unit] :
( ( ~ ( heap_T6932021131025641745rray_a @ X18953 @ X18954 )
| ( ( heap_T5591663578999710211rray_a @ X18953 @ X18954 )
!= none_P2587165478634041381it_nat ) )
& ( ( ( heap_T5591663578999710211rray_a @ X18953 @ X18954 )
= none_P2587165478634041381it_nat )
| ( heap_T6932021131025641745rray_a @ X18953 @ X18954 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
thf(c_0_5,plain,
! [X18949: list_a,X18950: heap_e7401611519738050253t_unit] : ( heap_T6932021131025641745rray_a @ ( array_of_list_a @ X18949 ) @ X18950 ),
inference(variable_rename,[status(thm)],[fact_45_success__of__listI]) ).
thf(c_0_6,negated_conjecture,
( ( heap_T5591663578999710211rray_a @ ( array_of_list_a @ xs ) @ h )
= none_P2587165478634041381it_nat ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_7,plain,
! [X1: heap_T6362127782908069795rray_a,X2: heap_e7401611519738050253t_unit] :
( ~ ( heap_T6932021131025641745rray_a @ X1 @ X2 )
| ( ( heap_T5591663578999710211rray_a @ X1 @ X2 )
!= none_P2587165478634041381it_nat ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,plain,
! [X70: list_a,X2: heap_e7401611519738050253t_unit] : ( heap_T6932021131025641745rray_a @ ( array_of_list_a @ X70 ) @ X2 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
( ( heap_T5591663578999710211rray_a @ ( array_of_list_a @ xs ) @ h )
= none_P2587165478634041381it_nat ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
! [X70: list_a,X2: heap_e7401611519738050253t_unit] :
( ( heap_T5591663578999710211rray_a @ ( array_of_list_a @ X70 ) @ X2 )
!= none_P2587165478634041381it_nat ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_9,c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.15 % Problem : ITP216^3 : TPTP v8.2.0. Released v8.1.0.
% 0.08/0.16 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n010.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Sat May 18 17:39:52 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.21/0.51 Running higher-order theorem proving
% 0.21/0.51 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.02/1.36 # Version: 3.1.0-ho
% 1.02/1.36 # partial match(2): HMLLSMLLSSLNSFA
% 1.02/1.36 # Preprocessing class: HMLLSMLLSSLCHFA.
% 1.02/1.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.02/1.36 # Starting new_bool_8 with 1200s (4) cores
% 1.02/1.36 # Starting post_as_ho5 with 600s (2) cores
% 1.02/1.36 # Starting new_bool_9 with 300s (1) cores
% 1.02/1.36 # Starting new_bool_3 with 300s (1) cores
% 1.02/1.36 # post_as_ho5 with pid 8747 completed with status 0
% 1.02/1.36 # Result found by post_as_ho5
% 1.02/1.36 # partial match(2): HMLLSMLLSSLNSFA
% 1.02/1.36 # Preprocessing class: HMLLSMLLSSLCHFA.
% 1.02/1.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.02/1.36 # Starting new_bool_8 with 1200s (4) cores
% 1.02/1.36 # Starting post_as_ho5 with 600s (2) cores
% 1.02/1.36 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 1.02/1.36 # Search class: HGHSF-FFSF21-SHFFFFNN
% 1.02/1.36 # partial match(2): FGHSF-FFSF21-SFFFFFNN
% 1.02/1.36 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 1.02/1.36 # Starting SAT001_MinMin_p005000_rr_RG with 325s (1) cores
% 1.02/1.36 # Starting post_as_ho5 with 61s (1) cores
% 1.02/1.36 # SAT001_MinMin_p005000_rr_RG with pid 8750 completed with status 0
% 1.02/1.36 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.02/1.36 # partial match(2): HMLLSMLLSSLNSFA
% 1.02/1.36 # Preprocessing class: HMLLSMLLSSLCHFA.
% 1.02/1.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.02/1.36 # Starting new_bool_8 with 1200s (4) cores
% 1.02/1.36 # Starting post_as_ho5 with 600s (2) cores
% 1.02/1.36 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 1.02/1.36 # Search class: HGHSF-FFSF21-SHFFFFNN
% 1.02/1.36 # partial match(2): FGHSF-FFSF21-SFFFFFNN
% 1.02/1.36 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 1.02/1.36 # Starting SAT001_MinMin_p005000_rr_RG with 325s (1) cores
% 1.02/1.36 # Preprocessing time : 0.003 s
% 1.02/1.36 # Presaturation interreduction done
% 1.02/1.36
% 1.02/1.36 # Proof found!
% 1.02/1.36 # SZS status Theorem
% 1.02/1.36 # SZS output start CNFRefutation
% See solution above
% 1.02/1.36 # Parsed axioms : 10879
% 1.02/1.36 # Removed by relevancy pruning/SinE : 10874
% 1.02/1.36 # Initial clauses : 6
% 1.02/1.36 # Removed in clause preprocessing : 0
% 1.02/1.36 # Initial clauses in saturation : 6
% 1.02/1.36 # Processed clauses : 10
% 1.02/1.36 # ...of these trivial : 0
% 1.02/1.36 # ...subsumed : 1
% 1.02/1.36 # ...remaining for further processing : 9
% 1.02/1.36 # Other redundant clauses eliminated : 0
% 1.02/1.36 # Clauses deleted for lack of memory : 0
% 1.02/1.36 # Backward-subsumed : 0
% 1.02/1.36 # Backward-rewritten : 0
% 1.02/1.36 # Generated clauses : 2
% 1.02/1.36 # ...of the previous two non-redundant : 1
% 1.02/1.36 # ...aggressively subsumed : 0
% 1.02/1.36 # Contextual simplify-reflections : 0
% 1.02/1.36 # Paramodulations : 1
% 1.02/1.36 # Factorizations : 0
% 1.02/1.36 # NegExts : 0
% 1.02/1.36 # Equation resolutions : 0
% 1.02/1.36 # Disequality decompositions : 0
% 1.02/1.36 # Total rewrite steps : 0
% 1.02/1.36 # ...of those cached : 0
% 1.02/1.36 # Propositional unsat checks : 0
% 1.02/1.36 # Propositional check models : 0
% 1.02/1.36 # Propositional check unsatisfiable : 0
% 1.02/1.36 # Propositional clauses : 0
% 1.02/1.36 # Propositional clauses after purity: 0
% 1.02/1.36 # Propositional unsat core size : 0
% 1.02/1.36 # Propositional preprocessing time : 0.000
% 1.02/1.36 # Propositional encoding time : 0.000
% 1.02/1.36 # Propositional solver time : 0.000
% 1.02/1.36 # Success case prop preproc time : 0.000
% 1.02/1.36 # Success case prop encoding time : 0.000
% 1.02/1.36 # Success case prop solver time : 0.000
% 1.02/1.36 # Current number of processed clauses : 3
% 1.02/1.36 # Positive orientable unit clauses : 1
% 1.02/1.36 # Positive unorientable unit clauses: 0
% 1.02/1.36 # Negative unit clauses : 1
% 1.02/1.36 # Non-unit-clauses : 1
% 1.02/1.36 # Current number of unprocessed clauses: 2
% 1.02/1.36 # ...number of literals in the above : 4
% 1.02/1.36 # Current number of archived formulas : 0
% 1.02/1.36 # Current number of archived clauses : 6
% 1.02/1.36 # Clause-clause subsumption calls (NU) : 1
% 1.02/1.36 # Rec. Clause-clause subsumption calls : 1
% 1.02/1.36 # Non-unit clause-clause subsumptions : 1
% 1.02/1.36 # Unit Clause-clause subsumption calls : 1
% 1.02/1.36 # Rewrite failures with RHS unbound : 0
% 1.02/1.36 # BW rewrite match attempts : 0
% 1.02/1.36 # BW rewrite match successes : 0
% 1.02/1.36 # Condensation attempts : 0
% 1.02/1.36 # Condensation successes : 0
% 1.02/1.36 # Termbank termtop insertions : 148066
% 1.02/1.36 # Search garbage collected termcells : 88687
% 1.02/1.36
% 1.02/1.36 # -------------------------------------------------
% 1.02/1.36 # User time : 0.056 s
% 1.02/1.36 # System time : 0.038 s
% 1.02/1.36 # Total time : 0.094 s
% 1.02/1.36 # Maximum resident set size: 30188 pages
% 1.02/1.36
% 1.02/1.36 # -------------------------------------------------
% 1.02/1.36 # User time : 0.747 s
% 1.02/1.36 # System time : 0.086 s
% 1.02/1.36 # Total time : 0.832 s
% 1.02/1.36 # Maximum resident set size: 25036 pages
% 1.02/1.36 % E---3.1 exiting
% 1.02/1.36 % E exiting
%------------------------------------------------------------------------------