TSTP Solution File: COL117-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : COL117-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:29:11 EDT 2024
% Result : Unsatisfiable 0.15s 0.51s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 18 ( 11 unt; 0 nHn; 16 RR)
% Number of literals : 28 ( 0 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-4 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_3,negated_conjecture,
( ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OS,v_x_H),v_y_Ha),v_w),X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(v_x,v_z),c_Comb_Ocomb_Oop_A_D_D(v_ya,v_z)),X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
file('/export/starexec/sandbox2/tmp/tmp.K9b8LPEeJg/E---3.1_24797.p',cls_conjecture_3) ).
cnf(cls_Comb_Oparcontract_Ointros__3_0,axiom,
c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OS,X1),X2),X3),c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(X1,X3),c_Comb_Ocomb_Oop_A_D_D(X2,X3)),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
file('/export/starexec/sandbox2/tmp/tmp.K9b8LPEeJg/E---3.1_24797.p',cls_Comb_Oparcontract_Ointros__3_0) ).
cnf(cls_Comb_Oparcontract_Ointros__4_0,axiom,
( c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(X3,X1),c_Comb_Ocomb_Oop_A_D_D(X4,X2),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(X1,X2,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(X3,X4,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
file('/export/starexec/sandbox2/tmp/tmp.K9b8LPEeJg/E---3.1_24797.p',cls_Comb_Oparcontract_Ointros__4_0) ).
cnf(cls_conjecture_2,negated_conjecture,
c_in(c_Pair(v_ya,v_y_Ha,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
file('/export/starexec/sandbox2/tmp/tmp.K9b8LPEeJg/E---3.1_24797.p',cls_conjecture_2) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(c_Pair(v_z,v_w,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
file('/export/starexec/sandbox2/tmp/tmp.K9b8LPEeJg/E---3.1_24797.p',cls_conjecture_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(c_Pair(v_x,v_x_H,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
file('/export/starexec/sandbox2/tmp/tmp.K9b8LPEeJg/E---3.1_24797.p',cls_conjecture_1) ).
cnf(c_0_6,negated_conjecture,
( ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OS,v_x_H),v_y_Ha),v_w),X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(v_x,v_z),c_Comb_Ocomb_Oop_A_D_D(v_ya,v_z)),X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_7,negated_conjecture,
( ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OS,v_x_H),v_y_Ha),v_w),X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(v_x,v_z),c_Comb_Ocomb_Oop_A_D_D(v_ya,v_z)),X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
c_0_6 ).
cnf(c_0_8,axiom,
c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OS,X1),X2),X3),c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(X1,X3),c_Comb_Ocomb_Oop_A_D_D(X2,X3)),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
cls_Comb_Oparcontract_Ointros__3_0 ).
cnf(c_0_9,plain,
( c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(X3,X1),c_Comb_Ocomb_Oop_A_D_D(X4,X2),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(X1,X2,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(X3,X4,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
inference(fof_simplification,[status(thm)],[cls_Comb_Oparcontract_Ointros__4_0]) ).
cnf(c_0_10,negated_conjecture,
~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(v_x,v_z),c_Comb_Ocomb_Oop_A_D_D(v_ya,v_z)),c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(v_x_H,v_w),c_Comb_Ocomb_Oop_A_D_D(v_y_Ha,v_w)),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
( c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(X3,X1),c_Comb_Ocomb_Oop_A_D_D(X4,X2),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(X1,X2,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(X3,X4,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
c_0_9 ).
cnf(c_0_12,negated_conjecture,
( ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_x,v_z),c_Comb_Ocomb_Oop_A_D_D(v_x_H,v_w),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_ya,v_z),c_Comb_Ocomb_Oop_A_D_D(v_y_Ha,v_w),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,negated_conjecture,
c_in(c_Pair(v_ya,v_y_Ha,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
cls_conjecture_2 ).
cnf(c_0_14,negated_conjecture,
c_in(c_Pair(v_z,v_w,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
cls_conjecture_0 ).
cnf(c_0_15,negated_conjecture,
~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_x,v_z),c_Comb_Ocomb_Oop_A_D_D(v_x_H,v_w),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_11]),c_0_13]),c_0_14])]) ).
cnf(c_0_16,negated_conjecture,
c_in(c_Pair(v_x,v_x_H,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
cls_conjecture_1 ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_11]),c_0_16]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : COL117-1 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n006.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Fri May 3 11:30:34 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.15/0.48 Running first-order model finding
% 0.15/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.K9b8LPEeJg/E---3.1_24797.p
% 0.15/0.51 # Version: 3.1.0
% 0.15/0.51 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.15/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.51 # Starting sh5l with 300s (1) cores
% 0.15/0.51 # new_bool_3 with pid 24875 completed with status 0
% 0.15/0.51 # Result found by new_bool_3
% 0.15/0.51 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.15/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.51 # Search class: FHHSM-FFMS32-MFFFFFNN
% 0.15/0.51 # partial match(1): FGHSM-FFMS32-MFFFFFNN
% 0.15/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 0.15/0.51 # SAT001_MinMin_p005000_rr_RG with pid 24879 completed with status 0
% 0.15/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.51 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.15/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.51 # Search class: FHHSM-FFMS32-MFFFFFNN
% 0.15/0.51 # partial match(1): FGHSM-FFMS32-MFFFFFNN
% 0.15/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 0.15/0.51 # Preprocessing time : 0.002 s
% 0.15/0.51 # Presaturation interreduction done
% 0.15/0.51
% 0.15/0.51 # Proof found!
% 0.15/0.51 # SZS status Unsatisfiable
% 0.15/0.51 # SZS output start CNFRefutation
% See solution above
% 0.15/0.51 # Parsed axioms : 1407
% 0.15/0.51 # Removed by relevancy pruning/SinE : 1381
% 0.15/0.51 # Initial clauses : 26
% 0.15/0.51 # Removed in clause preprocessing : 0
% 0.15/0.51 # Initial clauses in saturation : 26
% 0.15/0.51 # Processed clauses : 54
% 0.15/0.51 # ...of these trivial : 0
% 0.15/0.51 # ...subsumed : 3
% 0.15/0.51 # ...remaining for further processing : 51
% 0.15/0.51 # Other redundant clauses eliminated : 0
% 0.15/0.51 # Clauses deleted for lack of memory : 0
% 0.15/0.51 # Backward-subsumed : 1
% 0.15/0.51 # Backward-rewritten : 0
% 0.15/0.51 # Generated clauses : 14
% 0.15/0.51 # ...of the previous two non-redundant : 9
% 0.15/0.51 # ...aggressively subsumed : 0
% 0.15/0.51 # Contextual simplify-reflections : 0
% 0.15/0.51 # Paramodulations : 10
% 0.15/0.51 # Factorizations : 0
% 0.15/0.51 # NegExts : 0
% 0.15/0.51 # Equation resolutions : 4
% 0.15/0.51 # Disequality decompositions : 0
% 0.15/0.51 # Total rewrite steps : 4
% 0.15/0.51 # ...of those cached : 1
% 0.15/0.51 # Propositional unsat checks : 0
% 0.15/0.51 # Propositional check models : 0
% 0.15/0.51 # Propositional check unsatisfiable : 0
% 0.15/0.51 # Propositional clauses : 0
% 0.15/0.51 # Propositional clauses after purity: 0
% 0.15/0.51 # Propositional unsat core size : 0
% 0.15/0.51 # Propositional preprocessing time : 0.000
% 0.15/0.51 # Propositional encoding time : 0.000
% 0.15/0.51 # Propositional solver time : 0.000
% 0.15/0.51 # Success case prop preproc time : 0.000
% 0.15/0.51 # Success case prop encoding time : 0.000
% 0.15/0.51 # Success case prop solver time : 0.000
% 0.15/0.51 # Current number of processed clauses : 27
% 0.15/0.51 # Positive orientable unit clauses : 7
% 0.15/0.51 # Positive unorientable unit clauses: 0
% 0.15/0.51 # Negative unit clauses : 8
% 0.15/0.51 # Non-unit-clauses : 12
% 0.15/0.51 # Current number of unprocessed clauses: 4
% 0.15/0.51 # ...number of literals in the above : 9
% 0.15/0.51 # Current number of archived formulas : 0
% 0.15/0.51 # Current number of archived clauses : 24
% 0.15/0.51 # Clause-clause subsumption calls (NU) : 100
% 0.15/0.51 # Rec. Clause-clause subsumption calls : 96
% 0.15/0.51 # Non-unit clause-clause subsumptions : 0
% 0.15/0.51 # Unit Clause-clause subsumption calls : 14
% 0.15/0.51 # Rewrite failures with RHS unbound : 0
% 0.15/0.51 # BW rewrite match attempts : 21
% 0.15/0.51 # BW rewrite match successes : 0
% 0.15/0.51 # Condensation attempts : 0
% 0.15/0.51 # Condensation successes : 0
% 0.15/0.51 # Termbank termtop insertions : 9795
% 0.15/0.51 # Search garbage collected termcells : 2882
% 0.15/0.51
% 0.15/0.51 # -------------------------------------------------
% 0.15/0.51 # User time : 0.009 s
% 0.15/0.51 # System time : 0.001 s
% 0.15/0.51 # Total time : 0.010 s
% 0.15/0.51 # Maximum resident set size: 2932 pages
% 0.15/0.51
% 0.15/0.51 # -------------------------------------------------
% 0.15/0.51 # User time : 0.026 s
% 0.15/0.51 # System time : 0.004 s
% 0.15/0.51 # Total time : 0.029 s
% 0.15/0.51 # Maximum resident set size: 2472 pages
% 0.15/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------