TSTP Solution File: COL123-2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : COL123-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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 : Sat May 4 07:28:28 EDT 2024
% Result : Unsatisfiable 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 31 ( 5 unt; 0 nHn; 31 RR)
% Number of literals : 71 ( 0 equ; 45 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-4 aty)
% Number of variables : 61 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Transitive__Closure_Ortrancl__trans_0,axiom,
( c_in(c_Pair(X5,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))
| ~ c_in(c_Pair(X1,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))
| ~ c_in(c_Pair(X5,X1,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.AqgH1Uasb3/E---3.1_10758.p',cls_Transitive__Closure_Ortrancl__trans_0) ).
cnf(cls_conjecture_3,negated_conjecture,
( c_in(c_Pair(X1,v_xaa(X1),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_x,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
file('/export/starexec/sandbox/tmp/tmp.AqgH1Uasb3/E---3.1_10758.p',cls_conjecture_3) ).
cnf(cls_Transitive__Closure_Or__into__rtrancl_0,axiom,
( c_in(X1,c_Transitive__Closure_Ortrancl(X2,X3),tc_prod(X3,X3))
| ~ c_in(X1,X2,tc_prod(X3,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.AqgH1Uasb3/E---3.1_10758.p',cls_Transitive__Closure_Or__into__rtrancl_0) ).
cnf(cls_conjecture_6,negated_conjecture,
( c_in(c_Pair(X1,v_xa(X2,X1,X3),t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X2,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
file('/export/starexec/sandbox/tmp/tmp.AqgH1Uasb3/E---3.1_10758.p',cls_conjecture_6) ).
cnf(cls_conjecture_5,negated_conjecture,
( ~ c_in(c_Pair(v_z,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_xb,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
file('/export/starexec/sandbox/tmp/tmp.AqgH1Uasb3/E---3.1_10758.p',cls_conjecture_5) ).
cnf(cls_conjecture_2,negated_conjecture,
c_in(c_Pair(v_x,v_xb,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file('/export/starexec/sandbox/tmp/tmp.AqgH1Uasb3/E---3.1_10758.p',cls_conjecture_2) ).
cnf(cls_conjecture_7,negated_conjecture,
( c_in(c_Pair(X1,v_xa(X2,X3,X1),t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X2,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
file('/export/starexec/sandbox/tmp/tmp.AqgH1Uasb3/E---3.1_10758.p',cls_conjecture_7) ).
cnf(cls_conjecture_4,negated_conjecture,
( c_in(c_Pair(v_y,v_xaa(X1),t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_x,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
file('/export/starexec/sandbox/tmp/tmp.AqgH1Uasb3/E---3.1_10758.p',cls_conjecture_4) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(c_Pair(v_y,v_z,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file('/export/starexec/sandbox/tmp/tmp.AqgH1Uasb3/E---3.1_10758.p',cls_conjecture_1) ).
cnf(c_0_9,plain,
( c_in(c_Pair(X5,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))
| ~ c_in(c_Pair(X1,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))
| ~ c_in(c_Pair(X5,X1,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3)) ),
inference(fof_simplification,[status(thm)],[cls_Transitive__Closure_Ortrancl__trans_0]) ).
cnf(c_0_10,negated_conjecture,
( c_in(c_Pair(X1,v_xaa(X1),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_x,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_11,plain,
( c_in(c_Pair(X5,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))
| ~ c_in(c_Pair(X1,X2,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3))
| ~ c_in(c_Pair(X5,X1,X3,X3),c_Transitive__Closure_Ortrancl(X4,X3),tc_prod(X3,X3)) ),
c_0_9 ).
cnf(c_0_12,negated_conjecture,
( c_in(c_Pair(X1,v_xaa(X1),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_x,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
c_0_10 ).
cnf(c_0_13,plain,
( c_in(X1,c_Transitive__Closure_Ortrancl(X2,X3),tc_prod(X3,X3))
| ~ c_in(X1,X2,tc_prod(X3,X3)) ),
inference(fof_simplification,[status(thm)],[cls_Transitive__Closure_Or__into__rtrancl_0]) ).
cnf(c_0_14,negated_conjecture,
( c_in(c_Pair(X1,X2,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_xaa(X1),X2,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_x,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( c_in(X1,c_Transitive__Closure_Ortrancl(X2,X3),tc_prod(X3,X3))
| ~ c_in(X1,X2,tc_prod(X3,X3)) ),
c_0_13 ).
cnf(c_0_16,negated_conjecture,
( c_in(c_Pair(X1,v_xa(X2,X1,X3),t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X2,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_6]) ).
cnf(c_0_17,negated_conjecture,
( ~ c_in(c_Pair(v_z,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_xb,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_5]) ).
cnf(c_0_18,negated_conjecture,
( c_in(c_Pair(X1,X2,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_xaa(X1),X2,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_x,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( c_in(c_Pair(X1,v_xa(X2,X1,X3),t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X2,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
c_0_16 ).
cnf(c_0_20,negated_conjecture,
( ~ c_in(c_Pair(v_z,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_xb,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
c_0_17 ).
cnf(c_0_21,negated_conjecture,
( c_in(c_Pair(X1,v_xa(X2,v_xaa(X1),X3),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X2,v_xaa(X1),t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_x,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
c_in(c_Pair(v_x,v_xb,t_a,t_a),v_r,tc_prod(t_a,t_a)),
cls_conjecture_2 ).
cnf(c_0_23,negated_conjecture,
( c_in(c_Pair(X1,v_xa(X2,X3,X1),t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X2,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_7]) ).
cnf(c_0_24,negated_conjecture,
( ~ c_in(c_Pair(v_z,v_xa(X1,v_xaa(v_xb),X2),t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X1,v_xaa(v_xb),t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X1,X2,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_25,negated_conjecture,
( c_in(c_Pair(X1,v_xa(X2,X3,X1),t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X2,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X2,X3,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
c_0_23 ).
cnf(c_0_26,negated_conjecture,
( c_in(c_Pair(v_y,v_xaa(X1),t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_x,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).
cnf(c_0_27,negated_conjecture,
( ~ c_in(c_Pair(X1,v_xaa(v_xb),t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X1,v_z,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( c_in(c_Pair(v_y,v_xaa(X1),t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_x,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
c_0_26 ).
cnf(c_0_29,negated_conjecture,
c_in(c_Pair(v_y,v_z,t_a,t_a),v_r,tc_prod(t_a,t_a)),
cls_conjecture_1 ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : COL123-2 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n031.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 12:11:02 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.AqgH1Uasb3/E---3.1_10758.p
% 0.21/0.50 # Version: 3.1.0
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 10862 completed with status 0
% 0.21/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FHHNF-FFMF32-SFFFFFNN
% 0.21/0.50 # partial match(1): FGHNF-FFMF32-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 285s (1) cores
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.50 # Starting new_bool_3 with 267s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 267s (1) cores
% 0.21/0.50 # Starting sh5l with 267s (1) cores
% 0.21/0.50 # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with pid 10867 completed with status 0
% 0.21/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FHHNF-FFMF32-SFFFFFNN
% 0.21/0.50 # partial match(1): FGHNF-FFMF32-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 285s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Unsatisfiable
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 9
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 9
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 9
% 0.21/0.50 # Processed clauses : 53
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 3
% 0.21/0.50 # ...remaining for further processing : 50
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 0
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 140
% 0.21/0.50 # ...of the previous two non-redundant : 139
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 140
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 5
% 0.21/0.50 # ...of those cached : 3
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 41
% 0.21/0.50 # Positive orientable unit clauses : 2
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 2
% 0.21/0.50 # Non-unit-clauses : 37
% 0.21/0.50 # Current number of unprocessed clauses: 104
% 0.21/0.50 # ...number of literals in the above : 376
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 9
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 531
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 399
% 0.21/0.50 # Non-unit clause-clause subsumptions : 3
% 0.21/0.50 # Unit Clause-clause subsumption calls : 14
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 0
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 5794
% 0.21/0.50 # Search garbage collected termcells : 26
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.004 s
% 0.21/0.50 # System time : 0.004 s
% 0.21/0.50 # Total time : 0.008 s
% 0.21/0.50 # Maximum resident set size: 1668 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.023 s
% 0.21/0.50 # System time : 0.012 s
% 0.21/0.50 # Total time : 0.035 s
% 0.21/0.50 # Maximum resident set size: 1704 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------