TSTP Solution File: ITP066^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP066^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:09 EDT 2024
% Result : Theorem 0.50s 0.60s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 22
% Syntax : Number of formulae : 34 ( 17 unt; 17 typ; 0 def)
% Number of atoms : 17 ( 16 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 216 ( 3 ~; 0 |; 0 &; 213 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Number of types : 3 ( 3 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 10 con; 0-3 aty)
% Number of variables : 27 ( 0 ^ 27 !; 0 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_sort2,type,
tree_a: $tType ).
thf(decl_sort3,type,
produc143150363Tree_a: $tType ).
thf(decl_39,type,
heapIm837449470Leaf_a: tree_a > produc143150363Tree_a ).
thf(decl_47,type,
t_a: a > tree_a > tree_a > tree_a ).
thf(decl_93,type,
produc686083979Tree_a: a > tree_a > produc143150363Tree_a ).
thf(decl_97,type,
product_fst_a_Tree_a: produc143150363Tree_a > a ).
thf(decl_101,type,
product_snd_a_Tree_a: produc143150363Tree_a > tree_a ).
thf(decl_128,type,
l1: tree_a ).
thf(decl_129,type,
l2: tree_a ).
thf(decl_130,type,
r1: tree_a ).
thf(decl_131,type,
r2: tree_a ).
thf(decl_134,type,
t_a2: tree_a ).
thf(decl_135,type,
v1: a ).
thf(decl_136,type,
v2: a ).
thf(decl_138,type,
v_a: a ).
thf(decl_139,type,
v3: a ).
thf(fact_0__C4__2_Oprems_C_I1_J,axiom,
( ( produc686083979Tree_a @ v_a @ t_a2 )
= ( heapIm837449470Leaf_a @ ( t_a @ v3 @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0__C4__2_Oprems_C_I1_J) ).
thf(fact_3__092_060open_062t_H_A_061_AT_Av_A_Isnd_A_IremoveLeaf_A_IT_Av1_Al1_Ar1_J_J_J_A_IT_Av2_Al2_Ar2_J_092_060close_062,axiom,
( t_a2
= ( t_a @ v3 @ ( product_snd_a_Tree_a @ ( heapIm837449470Leaf_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) @ ( t_a @ v2 @ l2 @ r2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3__092_060open_062t_H_A_061_AT_Av_A_Isnd_A_IremoveLeaf_A_IT_Av1_Al1_Ar1_J_J_J_A_IT_Av2_Al2_Ar2_J_092_060close_062) ).
thf(fact_5_removeLeaf_Osimps_I5_J,axiom,
! [X7: a,X8: a,X9: tree_a,X10: tree_a,X11: a,X12: tree_a,X13: tree_a] :
( ( heapIm837449470Leaf_a @ ( t_a @ X7 @ ( t_a @ X8 @ X9 @ X10 ) @ ( t_a @ X11 @ X12 @ X13 ) ) )
= ( produc686083979Tree_a @ ( product_fst_a_Tree_a @ ( heapIm837449470Leaf_a @ ( t_a @ X8 @ X9 @ X10 ) ) ) @ ( t_a @ X7 @ ( product_snd_a_Tree_a @ ( heapIm837449470Leaf_a @ ( t_a @ X8 @ X9 @ X10 ) ) ) @ ( t_a @ X11 @ X12 @ X13 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_5_removeLeaf_Osimps_I5_J) ).
thf(conj_0,conjecture,
( v_a
= ( product_fst_a_Tree_a @ ( heapIm837449470Leaf_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(fact_22_fst__conv,axiom,
! [X47: a,X48: tree_a] :
( ( product_fst_a_Tree_a @ ( produc686083979Tree_a @ X47 @ X48 ) )
= X47 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_22_fst__conv) ).
thf(c_0_5,plain,
( ( produc686083979Tree_a @ v_a @ t_a2 )
= ( heapIm837449470Leaf_a @ ( t_a @ v3 @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) ),
inference(split_conjunct,[status(thm)],[fact_0__C4__2_Oprems_C_I1_J]) ).
thf(c_0_6,plain,
( t_a2
= ( t_a @ v3 @ ( product_snd_a_Tree_a @ ( heapIm837449470Leaf_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) @ ( t_a @ v2 @ l2 @ r2 ) ) ),
inference(split_conjunct,[status(thm)],[fact_3__092_060open_062t_H_A_061_AT_Av_A_Isnd_A_IremoveLeaf_A_IT_Av1_Al1_Ar1_J_J_J_A_IT_Av2_Al2_Ar2_J_092_060close_062]) ).
thf(c_0_7,plain,
! [X1378: a,X1379: a,X1380: tree_a,X1381: tree_a,X1382: a,X1383: tree_a,X1384: tree_a] :
( ( heapIm837449470Leaf_a @ ( t_a @ X1378 @ ( t_a @ X1379 @ X1380 @ X1381 ) @ ( t_a @ X1382 @ X1383 @ X1384 ) ) )
= ( produc686083979Tree_a @ ( product_fst_a_Tree_a @ ( heapIm837449470Leaf_a @ ( t_a @ X1379 @ X1380 @ X1381 ) ) ) @ ( t_a @ X1378 @ ( product_snd_a_Tree_a @ ( heapIm837449470Leaf_a @ ( t_a @ X1379 @ X1380 @ X1381 ) ) ) @ ( t_a @ X1382 @ X1383 @ X1384 ) ) ) ),
inference(variable_rename,[status(thm)],[fact_5_removeLeaf_Osimps_I5_J]) ).
thf(c_0_8,negated_conjecture,
( v_a
!= ( product_fst_a_Tree_a @ ( heapIm837449470Leaf_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_9,plain,
! [X1346: a,X1347: tree_a] :
( ( product_fst_a_Tree_a @ ( produc686083979Tree_a @ X1346 @ X1347 ) )
= X1346 ),
inference(variable_rename,[status(thm)],[fact_22_fst__conv]) ).
thf(c_0_10,plain,
( ( produc686083979Tree_a @ v_a @ ( t_a @ v3 @ ( product_snd_a_Tree_a @ ( heapIm837449470Leaf_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) @ ( t_a @ v2 @ l2 @ r2 ) ) )
= ( heapIm837449470Leaf_a @ ( t_a @ v3 @ ( t_a @ v1 @ l1 @ r1 ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) ),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_11,plain,
! [X1: a,X2: tree_a,X3: tree_a,X4: a,X5: tree_a,X7: a,X6: tree_a] :
( ( heapIm837449470Leaf_a @ ( t_a @ X1 @ ( t_a @ X4 @ X2 @ X3 ) @ ( t_a @ X7 @ X5 @ X6 ) ) )
= ( produc686083979Tree_a @ ( product_fst_a_Tree_a @ ( heapIm837449470Leaf_a @ ( t_a @ X4 @ X2 @ X3 ) ) ) @ ( t_a @ X1 @ ( product_snd_a_Tree_a @ ( heapIm837449470Leaf_a @ ( t_a @ X4 @ X2 @ X3 ) ) ) @ ( t_a @ X7 @ X5 @ X6 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_12,negated_conjecture,
( v_a
!= ( product_fst_a_Tree_a @ ( heapIm837449470Leaf_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) ),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
thf(c_0_13,plain,
! [X2: tree_a,X1: a] :
( ( product_fst_a_Tree_a @ ( produc686083979Tree_a @ X1 @ X2 ) )
= X1 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_14,plain,
( ( produc686083979Tree_a @ v_a @ ( t_a @ v3 @ ( product_snd_a_Tree_a @ ( heapIm837449470Leaf_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) @ ( t_a @ v2 @ l2 @ r2 ) ) )
= ( produc686083979Tree_a @ ( product_fst_a_Tree_a @ ( heapIm837449470Leaf_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) @ ( t_a @ v3 @ ( product_snd_a_Tree_a @ ( heapIm837449470Leaf_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) @ ( t_a @ v2 @ l2 @ r2 ) ) ) ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_15,negated_conjecture,
( v_a
!= ( product_fst_a_Tree_a @ ( heapIm837449470Leaf_a @ ( t_a @ v1 @ l1 @ r1 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_16,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_13]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : ITP066^1 : TPTP v8.2.0. Released v7.5.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat May 18 15:46:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.50 Running higher-order theorem proving
% 0.20/0.50 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
% 0.50/0.60 # Version: 3.1.0-ho
% 0.50/0.60 # Preprocessing class: HSLMSMSMSSLNHFA.
% 0.50/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.60 # Starting new_ho_11 with 1500s (5) cores
% 0.50/0.60 # Starting additional_ho_5 with 300s (1) cores
% 0.50/0.60 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.50/0.60 # Starting full_lambda_7 with 300s (1) cores
% 0.50/0.60 # additional_ho_5 with pid 3823 completed with status 0
% 0.50/0.60 # Result found by additional_ho_5
% 0.50/0.60 # Preprocessing class: HSLMSMSMSSLNHFA.
% 0.50/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.60 # Starting new_ho_11 with 1500s (5) cores
% 0.50/0.60 # Starting additional_ho_5 with 300s (1) cores
% 0.50/0.60 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.50/0.60 # Search class: HGUSM-FSLM31-MHFFFSBN
% 0.50/0.60 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.50/0.60 # Starting lpo8_lambda_fix with 163s (1) cores
% 0.50/0.60 # lpo8_lambda_fix with pid 3826 completed with status 0
% 0.50/0.60 # Result found by lpo8_lambda_fix
% 0.50/0.60 # Preprocessing class: HSLMSMSMSSLNHFA.
% 0.50/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.60 # Starting new_ho_11 with 1500s (5) cores
% 0.50/0.60 # Starting additional_ho_5 with 300s (1) cores
% 0.50/0.60 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.50/0.60 # Search class: HGUSM-FSLM31-MHFFFSBN
% 0.50/0.60 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.50/0.60 # Starting lpo8_lambda_fix with 163s (1) cores
% 0.50/0.60 # Preprocessing time : 0.009 s
% 0.50/0.60 # Presaturation interreduction done
% 0.50/0.60
% 0.50/0.60 # Proof found!
% 0.50/0.60 # SZS status Theorem
% 0.50/0.60 # SZS output start CNFRefutation
% See solution above
% 0.50/0.60 # Parsed axioms : 507
% 0.50/0.60 # Removed by relevancy pruning/SinE : 377
% 0.50/0.60 # Initial clauses : 289
% 0.50/0.60 # Removed in clause preprocessing : 18
% 0.50/0.60 # Initial clauses in saturation : 271
% 0.50/0.60 # Processed clauses : 457
% 0.50/0.60 # ...of these trivial : 16
% 0.50/0.60 # ...subsumed : 178
% 0.50/0.60 # ...remaining for further processing : 263
% 0.50/0.60 # Other redundant clauses eliminated : 67
% 0.50/0.60 # Clauses deleted for lack of memory : 0
% 0.50/0.60 # Backward-subsumed : 5
% 0.50/0.60 # Backward-rewritten : 14
% 0.50/0.60 # Generated clauses : 356
% 0.50/0.60 # ...of the previous two non-redundant : 253
% 0.50/0.60 # ...aggressively subsumed : 0
% 0.50/0.60 # Contextual simplify-reflections : 0
% 0.50/0.60 # Paramodulations : 264
% 0.50/0.60 # Factorizations : 0
% 0.50/0.60 # NegExts : 0
% 0.50/0.60 # Equation resolutions : 79
% 0.50/0.60 # Disequality decompositions : 0
% 0.50/0.60 # Total rewrite steps : 180
% 0.50/0.60 # ...of those cached : 106
% 0.50/0.60 # Propositional unsat checks : 0
% 0.50/0.60 # Propositional check models : 0
% 0.50/0.60 # Propositional check unsatisfiable : 0
% 0.50/0.60 # Propositional clauses : 0
% 0.50/0.60 # Propositional clauses after purity: 0
% 0.50/0.60 # Propositional unsat core size : 0
% 0.50/0.60 # Propositional preprocessing time : 0.000
% 0.50/0.60 # Propositional encoding time : 0.000
% 0.50/0.60 # Propositional solver time : 0.000
% 0.50/0.60 # Success case prop preproc time : 0.000
% 0.50/0.60 # Success case prop encoding time : 0.000
% 0.50/0.60 # Success case prop solver time : 0.000
% 0.50/0.60 # Current number of processed clauses : 87
% 0.50/0.60 # Positive orientable unit clauses : 37
% 0.50/0.60 # Positive unorientable unit clauses: 2
% 0.50/0.60 # Negative unit clauses : 16
% 0.50/0.60 # Non-unit-clauses : 32
% 0.50/0.60 # Current number of unprocessed clauses: 172
% 0.50/0.60 # ...number of literals in the above : 429
% 0.50/0.60 # Current number of archived formulas : 0
% 0.50/0.60 # Current number of archived clauses : 150
% 0.50/0.60 # Clause-clause subsumption calls (NU) : 6234
% 0.50/0.60 # Rec. Clause-clause subsumption calls : 1393
% 0.50/0.60 # Non-unit clause-clause subsumptions : 125
% 0.50/0.60 # Unit Clause-clause subsumption calls : 159
% 0.50/0.60 # Rewrite failures with RHS unbound : 0
% 0.50/0.60 # BW rewrite match attempts : 67
% 0.50/0.60 # BW rewrite match successes : 62
% 0.50/0.60 # Condensation attempts : 457
% 0.50/0.60 # Condensation successes : 1
% 0.50/0.60 # Termbank termtop insertions : 47998
% 0.50/0.60 # Search garbage collected termcells : 8075
% 0.50/0.60
% 0.50/0.60 # -------------------------------------------------
% 0.50/0.60 # User time : 0.058 s
% 0.50/0.60 # System time : 0.008 s
% 0.50/0.60 # Total time : 0.066 s
% 0.50/0.60 # Maximum resident set size: 3952 pages
% 0.50/0.60
% 0.50/0.60 # -------------------------------------------------
% 0.50/0.60 # User time : 0.073 s
% 0.50/0.60 # System time : 0.015 s
% 0.50/0.60 # Total time : 0.088 s
% 0.50/0.60 # Maximum resident set size: 2880 pages
% 0.50/0.60 % E---3.1 exiting
% 0.50/0.60 % E exiting
%------------------------------------------------------------------------------