TSTP Solution File: COL105-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : COL105-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:07 EDT 2024
% Result : Unsatisfiable 0.40s 0.62s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 5 unt; 0 nHn; 6 RR)
% Number of literals : 11 ( 0 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-4 aty)
% Number of variables : 5 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_1,negated_conjecture,
( ~ c_in(c_Pair(v_xb,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(v_x,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
file('/export/starexec/sandbox/tmp/tmp.MMMrEOS84U/E---3.1_22994.p',cls_conjecture_1) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(c_Pair(v_x,v_xb,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
file('/export/starexec/sandbox/tmp/tmp.MMMrEOS84U/E---3.1_22994.p',cls_conjecture_0) ).
cnf(cls_Comb_Oparcontract_Ointros__1_0,axiom,
c_in(c_Pair(X1,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
file('/export/starexec/sandbox/tmp/tmp.MMMrEOS84U/E---3.1_22994.p',cls_Comb_Oparcontract_Ointros__1_0) ).
cnf(c_0_3,negated_conjecture,
( ~ c_in(c_Pair(v_xb,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(v_x,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_1]) ).
cnf(c_0_4,negated_conjecture,
( ~ c_in(c_Pair(v_xb,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(v_x,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
c_0_3 ).
cnf(c_0_5,negated_conjecture,
c_in(c_Pair(v_x,v_xb,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
cls_conjecture_0 ).
cnf(c_0_6,axiom,
c_in(c_Pair(X1,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
cls_Comb_Oparcontract_Ointros__1_0 ).
cnf(c_0_7,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COL105-1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 12:00:21 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.40/0.59 Running first-order model finding
% 0.40/0.59 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.MMMrEOS84U/E---3.1_22994.p
% 0.40/0.62 # Version: 3.1.0
% 0.40/0.62 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.40/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.40/0.62 # Starting new_bool_3 with 300s (1) cores
% 0.40/0.62 # Starting new_bool_1 with 300s (1) cores
% 0.40/0.62 # Starting sh5l with 300s (1) cores
% 0.40/0.62 # new_bool_3 with pid 23154 completed with status 0
% 0.40/0.62 # Result found by new_bool_3
% 0.40/0.62 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.40/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.40/0.62 # Starting new_bool_3 with 300s (1) cores
% 0.40/0.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.40/0.62 # Search class: FHHSM-FFMF32-MFFFFFNN
% 0.40/0.62 # partial match(1): FGHSM-FFMF32-MFFFFFNN
% 0.40/0.62 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S038I with 181s (1) cores
% 0.40/0.62 # G-E--_208_C18_F1_SE_CS_SP_PS_S038I with pid 23160 completed with status 0
% 0.40/0.62 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S038I
% 0.40/0.62 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.40/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.40/0.62 # Starting new_bool_3 with 300s (1) cores
% 0.40/0.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.40/0.62 # Search class: FHHSM-FFMF32-MFFFFFNN
% 0.40/0.62 # partial match(1): FGHSM-FFMF32-MFFFFFNN
% 0.40/0.62 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.62 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S038I with 181s (1) cores
% 0.40/0.62 # Preprocessing time : 0.004 s
% 0.40/0.62 # Presaturation interreduction done
% 0.40/0.62
% 0.40/0.62 # Proof found!
% 0.40/0.62 # SZS status Unsatisfiable
% 0.40/0.62 # SZS output start CNFRefutation
% See solution above
% 0.40/0.62 # Parsed axioms : 1405
% 0.40/0.62 # Removed by relevancy pruning/SinE : 1381
% 0.40/0.62 # Initial clauses : 24
% 0.40/0.62 # Removed in clause preprocessing : 0
% 0.40/0.62 # Initial clauses in saturation : 24
% 0.40/0.62 # Processed clauses : 34
% 0.40/0.62 # ...of these trivial : 0
% 0.40/0.62 # ...subsumed : 3
% 0.40/0.62 # ...remaining for further processing : 30
% 0.40/0.62 # Other redundant clauses eliminated : 0
% 0.40/0.62 # Clauses deleted for lack of memory : 0
% 0.40/0.62 # Backward-subsumed : 0
% 0.40/0.62 # Backward-rewritten : 0
% 0.40/0.62 # Generated clauses : 4
% 0.40/0.62 # ...of the previous two non-redundant : 2
% 0.40/0.62 # ...aggressively subsumed : 0
% 0.40/0.62 # Contextual simplify-reflections : 0
% 0.40/0.62 # Paramodulations : 2
% 0.40/0.62 # Factorizations : 0
% 0.40/0.62 # NegExts : 0
% 0.40/0.62 # Equation resolutions : 2
% 0.40/0.62 # Disequality decompositions : 0
% 0.40/0.62 # Total rewrite steps : 1
% 0.40/0.62 # ...of those cached : 0
% 0.40/0.62 # Propositional unsat checks : 0
% 0.40/0.62 # Propositional check models : 0
% 0.40/0.62 # Propositional check unsatisfiable : 0
% 0.40/0.62 # Propositional clauses : 0
% 0.40/0.62 # Propositional clauses after purity: 0
% 0.40/0.62 # Propositional unsat core size : 0
% 0.40/0.62 # Propositional preprocessing time : 0.000
% 0.40/0.62 # Propositional encoding time : 0.000
% 0.40/0.62 # Propositional solver time : 0.000
% 0.40/0.62 # Success case prop preproc time : 0.000
% 0.40/0.62 # Success case prop encoding time : 0.000
% 0.40/0.62 # Success case prop solver time : 0.000
% 0.40/0.62 # Current number of processed clauses : 9
% 0.40/0.62 # Positive orientable unit clauses : 2
% 0.40/0.62 # Positive unorientable unit clauses: 0
% 0.40/0.62 # Negative unit clauses : 4
% 0.40/0.62 # Non-unit-clauses : 3
% 0.40/0.62 # Current number of unprocessed clauses: 13
% 0.40/0.62 # ...number of literals in the above : 21
% 0.40/0.62 # Current number of archived formulas : 0
% 0.40/0.62 # Current number of archived clauses : 21
% 0.40/0.62 # Clause-clause subsumption calls (NU) : 17
% 0.40/0.62 # Rec. Clause-clause subsumption calls : 16
% 0.40/0.62 # Non-unit clause-clause subsumptions : 0
% 0.40/0.62 # Unit Clause-clause subsumption calls : 0
% 0.40/0.62 # Rewrite failures with RHS unbound : 0
% 0.40/0.62 # BW rewrite match attempts : 9
% 0.40/0.62 # BW rewrite match successes : 0
% 0.40/0.62 # Condensation attempts : 0
% 0.40/0.62 # Condensation successes : 0
% 0.40/0.62 # Termbank termtop insertions : 9315
% 0.40/0.62 # Search garbage collected termcells : 2882
% 0.40/0.62
% 0.40/0.62 # -------------------------------------------------
% 0.40/0.62 # User time : 0.006 s
% 0.40/0.62 # System time : 0.006 s
% 0.40/0.62 # Total time : 0.012 s
% 0.40/0.62 # Maximum resident set size: 2932 pages
% 0.40/0.62
% 0.40/0.62 # -------------------------------------------------
% 0.40/0.62 # User time : 0.020 s
% 0.40/0.62 # System time : 0.009 s
% 0.40/0.62 # Total time : 0.029 s
% 0.40/0.62 # Maximum resident set size: 2460 pages
% 0.40/0.62 % E---3.1 exiting
%------------------------------------------------------------------------------