TSTP Solution File: COL124-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : COL124-2 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 19:03:25 EDT 2024
% Result : Unsatisfiable 0.21s 0.48s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of clauses : 11 ( 7 unt; 0 nHn; 9 RR)
% Number of literals : 18 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-4 aty)
% Number of variables : 20 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Comb_OI__contract__E_0,axiom,
~ c_in(c_Pair(c_Comb_OI,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Comb_OI__contract__E_0) ).
cnf(cls_conjecture_0,negated_conjecture,
( c_in(c_Pair(X1,v_x(X2,X1,X3),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(X2,X3,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(X2,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Comb_Ocontract_OK_0,axiom,
c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,X1),X2),X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Comb_Ocontract_OK_0) ).
cnf(c_0_3,plain,
~ c_in(c_Pair(c_Comb_OI,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
inference(fof_simplification,[status(thm)],[cls_Comb_OI__contract__E_0]) ).
cnf(c_0_4,negated_conjecture,
( c_in(c_Pair(X1,v_x(X2,X1,X3),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(X2,X3,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(X2,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_5,plain,
~ c_in(c_Pair(c_Comb_OI,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
c_0_3 ).
cnf(c_0_6,negated_conjecture,
( c_in(c_Pair(X1,v_x(X2,X1,X3),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(X2,X3,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(X2,X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
c_0_4 ).
cnf(c_0_7,negated_conjecture,
( ~ c_in(c_Pair(X1,c_Comb_OI,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(X1,X2,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
inference(spm,[status(thm)],[c_0_5,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_OK,X1),X2),X1,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
cls_Comb_Ocontract_OK_0 ).
cnf(c_0_9,negated_conjecture,
~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,c_Comb_OI),X1),X2,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_9,c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COL124-2 : TPTP v8.2.0. Released v3.2.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n003.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sat May 18 13:19:08 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.47 Running first-order model finding
% 0.21/0.47 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/benchmark/theBenchmark.p
% 0.21/0.48 # Version: 3.1.0
% 0.21/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.48 # Starting sh5l with 300s (1) cores
% 0.21/0.48 # sh5l with pid 15895 completed with status 0
% 0.21/0.48 # Result found by sh5l
% 0.21/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.48 # Starting sh5l with 300s (1) cores
% 0.21/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.48 # Search class: FHUNF-FFSF32-MFFFFFNN
% 0.21/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.48 # SAT001_MinMin_p005000_rr_RG with pid 15902 completed with status 0
% 0.21/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.48 # Starting sh5l with 300s (1) cores
% 0.21/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.48 # Search class: FHUNF-FFSF32-MFFFFFNN
% 0.21/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.48 # Preprocessing time : 0.001 s
% 0.21/0.48 # Presaturation interreduction done
% 0.21/0.48
% 0.21/0.48 # Proof found!
% 0.21/0.48 # SZS status Unsatisfiable
% 0.21/0.48 # SZS output start CNFRefutation
% See solution above
% 0.21/0.48 # Parsed axioms : 3
% 0.21/0.48 # Removed by relevancy pruning/SinE : 0
% 0.21/0.48 # Initial clauses : 3
% 0.21/0.48 # Removed in clause preprocessing : 0
% 0.21/0.48 # Initial clauses in saturation : 3
% 0.21/0.48 # Processed clauses : 8
% 0.21/0.48 # ...of these trivial : 0
% 0.21/0.48 # ...subsumed : 0
% 0.21/0.48 # ...remaining for further processing : 8
% 0.21/0.48 # Other redundant clauses eliminated : 0
% 0.21/0.48 # Clauses deleted for lack of memory : 0
% 0.21/0.48 # Backward-subsumed : 0
% 0.21/0.48 # Backward-rewritten : 0
% 0.21/0.48 # Generated clauses : 4
% 0.21/0.48 # ...of the previous two non-redundant : 3
% 0.21/0.48 # ...aggressively subsumed : 0
% 0.21/0.48 # Contextual simplify-reflections : 0
% 0.21/0.48 # Paramodulations : 4
% 0.21/0.48 # Factorizations : 0
% 0.21/0.48 # NegExts : 0
% 0.21/0.48 # Equation resolutions : 0
% 0.21/0.48 # Disequality decompositions : 0
% 0.21/0.48 # Total rewrite steps : 0
% 0.21/0.48 # ...of those cached : 0
% 0.21/0.48 # Propositional unsat checks : 0
% 0.21/0.48 # Propositional check models : 0
% 0.21/0.48 # Propositional check unsatisfiable : 0
% 0.21/0.48 # Propositional clauses : 0
% 0.21/0.48 # Propositional clauses after purity: 0
% 0.21/0.48 # Propositional unsat core size : 0
% 0.21/0.48 # Propositional preprocessing time : 0.000
% 0.21/0.48 # Propositional encoding time : 0.000
% 0.21/0.48 # Propositional solver time : 0.000
% 0.21/0.48 # Success case prop preproc time : 0.000
% 0.21/0.48 # Success case prop encoding time : 0.000
% 0.21/0.48 # Success case prop solver time : 0.000
% 0.21/0.48 # Current number of processed clauses : 5
% 0.21/0.48 # Positive orientable unit clauses : 1
% 0.21/0.48 # Positive unorientable unit clauses: 0
% 0.21/0.48 # Negative unit clauses : 2
% 0.21/0.48 # Non-unit-clauses : 2
% 0.21/0.48 # Current number of unprocessed clauses: 0
% 0.21/0.48 # ...number of literals in the above : 0
% 0.21/0.48 # Current number of archived formulas : 0
% 0.21/0.48 # Current number of archived clauses : 3
% 0.21/0.48 # Clause-clause subsumption calls (NU) : 1
% 0.21/0.48 # Rec. Clause-clause subsumption calls : 1
% 0.21/0.48 # Non-unit clause-clause subsumptions : 0
% 0.21/0.48 # Unit Clause-clause subsumption calls : 3
% 0.21/0.48 # Rewrite failures with RHS unbound : 0
% 0.21/0.48 # BW rewrite match attempts : 0
% 0.21/0.48 # BW rewrite match successes : 0
% 0.21/0.48 # Condensation attempts : 0
% 0.21/0.48 # Condensation successes : 0
% 0.21/0.48 # Termbank termtop insertions : 314
% 0.21/0.48 # Search garbage collected termcells : 8
% 0.21/0.48
% 0.21/0.48 # -------------------------------------------------
% 0.21/0.48 # User time : 0.002 s
% 0.21/0.48 # System time : 0.002 s
% 0.21/0.48 # Total time : 0.004 s
% 0.21/0.48 # Maximum resident set size: 1620 pages
% 0.21/0.48
% 0.21/0.48 # -------------------------------------------------
% 0.21/0.48 # User time : 0.003 s
% 0.21/0.48 # System time : 0.004 s
% 0.21/0.48 # Total time : 0.007 s
% 0.21/0.48 # Maximum resident set size: 1692 pages
% 0.21/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------