TSTP Solution File: SCT002-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SCT002-1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 : Tue May 21 02:45:21 EDT 2024
% Result : Unsatisfiable 1.81s 0.73s
% Output : CNFRefutation 1.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 24 ( 14 unt; 0 nHn; 19 RR)
% Number of literals : 40 ( 0 equ; 19 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-4 aty)
% Number of variables : 39 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_mem__def_0,axiom,
( hBOOL(hAPP(X1,X2))
| ~ hBOOL(c_in(X2,X1,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_mem__def_0) ).
cnf(cls_mem__def_1,axiom,
( hBOOL(c_in(X1,X2,X3))
| ~ hBOOL(hAPP(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_mem__def_1) ).
cnf(cls_conjecture_3,negated_conjecture,
hBOOL(c_in(c_Pair(v_y,v_x,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_L,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_trans__def_0,axiom,
( hBOOL(c_in(c_Pair(X1,X2,X3,X3),X4,tc_prod(X3,X3)))
| ~ hBOOL(c_in(c_Pair(X5,X2,X3,X3),X4,tc_prod(X3,X3)))
| ~ hBOOL(c_in(c_Pair(X1,X5,X3,X3),X4,tc_prod(X3,X3)))
| ~ c_Relation_Otrans(X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_trans__def_0) ).
cnf(cls_conjecture_4,negated_conjecture,
hBOOL(c_in(c_Pair(v_x,v_y,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_L,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_conjecture_1,negated_conjecture,
c_Relation_Otrans(v_L,tc_Arrow__Order__Mirabelle_Oalt),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_conjecture_2,negated_conjecture,
~ hBOOL(c_in(c_Pair(X1,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_L,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(c_0_7,plain,
( hBOOL(hAPP(X1,X2))
| ~ hBOOL(c_in(X2,X1,X3)) ),
inference(fof_simplification,[status(thm)],[cls_mem__def_0]) ).
cnf(c_0_8,plain,
( hBOOL(c_in(X1,X2,X3))
| ~ hBOOL(hAPP(X2,X1)) ),
inference(fof_simplification,[status(thm)],[cls_mem__def_1]) ).
cnf(c_0_9,plain,
( hBOOL(hAPP(X1,X2))
| ~ hBOOL(c_in(X2,X1,X3)) ),
c_0_7 ).
cnf(c_0_10,negated_conjecture,
hBOOL(c_in(c_Pair(v_y,v_x,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_L,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
cls_conjecture_3 ).
cnf(c_0_11,plain,
( hBOOL(c_in(c_Pair(X1,X2,X3,X3),X4,tc_prod(X3,X3)))
| ~ hBOOL(c_in(c_Pair(X5,X2,X3,X3),X4,tc_prod(X3,X3)))
| ~ hBOOL(c_in(c_Pair(X1,X5,X3,X3),X4,tc_prod(X3,X3)))
| ~ c_Relation_Otrans(X4,X3) ),
inference(fof_simplification,[status(thm)],[cls_trans__def_0]) ).
cnf(c_0_12,plain,
( hBOOL(c_in(X1,X2,X3))
| ~ hBOOL(hAPP(X2,X1)) ),
c_0_8 ).
cnf(c_0_13,negated_conjecture,
hBOOL(hAPP(v_L,c_Pair(v_y,v_x,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
hBOOL(c_in(c_Pair(v_x,v_y,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_L,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
cls_conjecture_4 ).
cnf(c_0_15,plain,
( hBOOL(c_in(c_Pair(X1,X2,X3,X3),X4,tc_prod(X3,X3)))
| ~ hBOOL(c_in(c_Pair(X5,X2,X3,X3),X4,tc_prod(X3,X3)))
| ~ hBOOL(c_in(c_Pair(X1,X5,X3,X3),X4,tc_prod(X3,X3)))
| ~ c_Relation_Otrans(X4,X3) ),
c_0_11 ).
cnf(c_0_16,negated_conjecture,
hBOOL(c_in(c_Pair(v_y,v_x,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_L,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
c_Relation_Otrans(v_L,tc_Arrow__Order__Mirabelle_Oalt),
cls_conjecture_1 ).
cnf(c_0_18,negated_conjecture,
hBOOL(hAPP(v_L,c_Pair(v_x,v_y,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
~ hBOOL(c_in(c_Pair(X1,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_L,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_20,negated_conjecture,
( hBOOL(c_in(c_Pair(X1,v_x,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_L,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
| ~ hBOOL(c_in(c_Pair(X1,v_y,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_L,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_21,negated_conjecture,
hBOOL(c_in(c_Pair(v_x,v_y,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_L,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
~ hBOOL(c_in(c_Pair(X1,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_L,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
c_0_19 ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SCT002-1 : TPTP v8.2.0. Released v4.1.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.11/0.34 % Computer : n011.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8042.1875MB
% 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 300
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Mon May 20 00:19:53 EDT 2024
% 0.11/0.34 % CPUTime :
% 0.19/0.46 Running first-order model finding
% 0.19/0.46 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/benchmark/theBenchmark.p
% 1.81/0.73 # Version: 3.1.0
% 1.81/0.73 # Preprocessing class: FSLMSMSMSSSNFFN.
% 1.81/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.81/0.73 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 1.81/0.73 # Starting new_bool_3 with 600s (2) cores
% 1.81/0.73 # Starting new_bool_1 with 300s (1) cores
% 1.81/0.73 # Starting sh5l with 300s (1) cores
% 1.81/0.73 # G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with pid 29317 completed with status 0
% 1.81/0.73 # Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S
% 1.81/0.73 # Preprocessing class: FSLMSMSMSSSNFFN.
% 1.81/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.81/0.73 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 1.81/0.73 # No SInE strategy applied
% 1.81/0.73 # Search class: FGHSM-FSLM33-DFFFFFNN
% 1.81/0.73 # Scheduled 10 strats onto 4 cores with 1200 seconds (1200 total)
% 1.81/0.73 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S with 217s (1) cores
% 1.81/0.73 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 121s (1) cores
% 1.81/0.73 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 109s (1) cores
% 1.81/0.73 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S070I with 109s (1) cores
% 1.81/0.73 # G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S with pid 29325 completed with status 0
% 1.81/0.73 # Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S
% 1.81/0.73 # Preprocessing class: FSLMSMSMSSSNFFN.
% 1.81/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.81/0.73 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 1.81/0.73 # No SInE strategy applied
% 1.81/0.73 # Search class: FGHSM-FSLM33-DFFFFFNN
% 1.81/0.73 # Scheduled 10 strats onto 4 cores with 1200 seconds (1200 total)
% 1.81/0.73 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S with 217s (1) cores
% 1.81/0.73 # Preprocessing time : 0.009 s
% 1.81/0.73 # Presaturation interreduction done
% 1.81/0.73
% 1.81/0.73 # Proof found!
% 1.81/0.73 # SZS status Unsatisfiable
% 1.81/0.73 # SZS output start CNFRefutation
% See solution above
% 1.81/0.73 # Parsed axioms : 677
% 1.81/0.73 # Removed by relevancy pruning/SinE : 0
% 1.81/0.73 # Initial clauses : 677
% 1.81/0.73 # Removed in clause preprocessing : 7
% 1.81/0.73 # Initial clauses in saturation : 670
% 1.81/0.73 # Processed clauses : 1399
% 1.81/0.73 # ...of these trivial : 45
% 1.81/0.73 # ...subsumed : 141
% 1.81/0.73 # ...remaining for further processing : 1213
% 1.81/0.73 # Other redundant clauses eliminated : 0
% 1.81/0.73 # Clauses deleted for lack of memory : 0
% 1.81/0.73 # Backward-subsumed : 1
% 1.81/0.73 # Backward-rewritten : 9
% 1.81/0.73 # Generated clauses : 6868
% 1.81/0.73 # ...of the previous two non-redundant : 5715
% 1.81/0.73 # ...aggressively subsumed : 0
% 1.81/0.73 # Contextual simplify-reflections : 0
% 1.81/0.73 # Paramodulations : 6859
% 1.81/0.73 # Factorizations : 2
% 1.81/0.73 # NegExts : 0
% 1.81/0.73 # Equation resolutions : 7
% 1.81/0.73 # Disequality decompositions : 0
% 1.81/0.73 # Total rewrite steps : 2904
% 1.81/0.73 # ...of those cached : 1757
% 1.81/0.73 # Propositional unsat checks : 0
% 1.81/0.73 # Propositional check models : 0
% 1.81/0.73 # Propositional check unsatisfiable : 0
% 1.81/0.73 # Propositional clauses : 0
% 1.81/0.73 # Propositional clauses after purity: 0
% 1.81/0.73 # Propositional unsat core size : 0
% 1.81/0.73 # Propositional preprocessing time : 0.000
% 1.81/0.73 # Propositional encoding time : 0.000
% 1.81/0.73 # Propositional solver time : 0.000
% 1.81/0.73 # Success case prop preproc time : 0.000
% 1.81/0.73 # Success case prop encoding time : 0.000
% 1.81/0.73 # Success case prop solver time : 0.000
% 1.81/0.73 # Current number of processed clauses : 633
% 1.81/0.73 # Positive orientable unit clauses : 183
% 1.81/0.73 # Positive unorientable unit clauses: 9
% 1.81/0.73 # Negative unit clauses : 18
% 1.81/0.73 # Non-unit-clauses : 423
% 1.81/0.73 # Current number of unprocessed clauses: 5531
% 1.81/0.73 # ...number of literals in the above : 10824
% 1.81/0.73 # Current number of archived formulas : 0
% 1.81/0.73 # Current number of archived clauses : 584
% 1.81/0.73 # Clause-clause subsumption calls (NU) : 57438
% 1.81/0.73 # Rec. Clause-clause subsumption calls : 39478
% 1.81/0.73 # Non-unit clause-clause subsumptions : 68
% 1.81/0.73 # Unit Clause-clause subsumption calls : 2637
% 1.81/0.73 # Rewrite failures with RHS unbound : 0
% 1.81/0.73 # BW rewrite match attempts : 610
% 1.81/0.73 # BW rewrite match successes : 83
% 1.81/0.73 # Condensation attempts : 0
% 1.81/0.73 # Condensation successes : 0
% 1.81/0.73 # Termbank termtop insertions : 174013
% 1.81/0.73 # Search garbage collected termcells : 1214
% 1.81/0.73
% 1.81/0.73 # -------------------------------------------------
% 1.81/0.73 # User time : 0.216 s
% 1.81/0.73 # System time : 0.015 s
% 1.81/0.73 # Total time : 0.231 s
% 1.81/0.73 # Maximum resident set size: 3200 pages
% 1.81/0.73
% 1.81/0.73 # -------------------------------------------------
% 1.81/0.73 # User time : 0.857 s
% 1.81/0.73 # System time : 0.047 s
% 1.81/0.73 # Total time : 0.904 s
% 1.81/0.73 # Maximum resident set size: 2284 pages
% 1.81/0.73 % E---3.1 exiting
%------------------------------------------------------------------------------