TSTP Solution File: SCT073-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SCT073-1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:44:42 EDT 2024
% Result : Unsatisfiable 0.92s 0.58s
% Output : CNFRefutation 0.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 30 ( 11 unt; 6 nHn; 17 RR)
% Number of literals : 52 ( 13 equ; 25 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-4 aty)
% Number of variables : 57 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_that_0,axiom,
( v_thesis____
| ~ c_in(X1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
| ~ c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X1,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_that_0) ).
cnf(cls_conjecture_0,negated_conjecture,
~ v_thesis____,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_mem__def_1,axiom,
( c_in(X1,X2,X3)
| ~ hBOOL(hAPP(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_mem__def_1) ).
cnf(cls_insert__code_1,axiom,
hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_insert__code_1) ).
cnf(cls_insert__absorb_0,axiom,
( c_Set_Oinsert(X1,X2,X3) = X2
| ~ c_in(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_insert__absorb_0) ).
cnf(cls_complete__Lin_0,axiom,
( c_in(v_sko__Arrow__Order__Mirabelle__Xcomplete__Lin__1(X1,X2),c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_complete__Lin_0) ).
cnf(cls_complete__Lin_1,axiom,
( c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_sko__Arrow__Order__Mirabelle__Xcomplete__Lin__1(X1,X2),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_complete__Lin_1) ).
cnf(cls_CHAINED_0,axiom,
v_a____ != v_b____,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_CHAINED_0) ).
cnf(c_0_8,plain,
( v_thesis____
| ~ c_in(X1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
| ~ c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X1,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
inference(fof_simplification,[status(thm)],[cls_that_0]) ).
cnf(c_0_9,negated_conjecture,
~ v_thesis____,
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_10,plain,
( c_in(X1,X2,X3)
| ~ hBOOL(hAPP(X2,X1)) ),
inference(fof_simplification,[status(thm)],[cls_mem__def_1]) ).
cnf(c_0_11,plain,
( v_thesis____
| ~ c_in(X1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
| ~ c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X1,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
c_0_8 ).
cnf(c_0_12,negated_conjecture,
~ v_thesis____,
c_0_9 ).
cnf(c_0_13,plain,
( c_in(X1,X2,X3)
| ~ hBOOL(hAPP(X2,X1)) ),
c_0_10 ).
cnf(c_0_14,axiom,
hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X1)),
cls_insert__code_1 ).
cnf(c_0_15,plain,
( c_Set_Oinsert(X1,X2,X3) = X2
| ~ c_in(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[cls_insert__absorb_0]) ).
cnf(c_0_16,plain,
( ~ c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X1,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| ~ c_in(X1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)) ),
inference(sr,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
c_in(X1,c_Set_Oinsert(X1,X2,X3),X4),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( c_Set_Oinsert(X1,X2,X3) = X2
| ~ c_in(X1,X2,X3) ),
c_0_15 ).
cnf(c_0_19,plain,
~ c_in(c_Set_Oinsert(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X1,X2),c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( c_in(X1,X2,X3)
| ~ c_in(X1,X2,X4) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,axiom,
( c_in(v_sko__Arrow__Order__Mirabelle__Xcomplete__Lin__1(X1,X2),c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
| X1 = X2 ),
cls_complete__Lin_0 ).
cnf(c_0_22,plain,
( ~ c_in(X1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
| ~ c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_23,plain,
( X1 = X2
| c_in(v_sko__Arrow__Order__Mirabelle__Xcomplete__Lin__1(X1,X2),c_Arrow__Order__Mirabelle_OLin,X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,axiom,
( c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_sko__Arrow__Order__Mirabelle__Xcomplete__Lin__1(X1,X2),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| X1 = X2 ),
cls_complete__Lin_1 ).
cnf(c_0_25,plain,
v_a____ != v_b____,
inference(fof_simplification,[status(thm)],[cls_CHAINED_0]) ).
cnf(c_0_26,plain,
( X1 = X2
| ~ c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_sko__Arrow__Order__Mirabelle__Xcomplete__Lin__1(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( X1 = X2
| c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_sko__Arrow__Order__Mirabelle__Xcomplete__Lin__1(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_24]) ).
cnf(c_0_28,plain,
v_a____ != v_b____,
c_0_25 ).
cnf(c_0_29,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SCT073-1 : TPTP v8.2.0. Released v4.1.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n009.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon May 20 00:06:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.92/0.58 # Version: 3.1.0
% 0.92/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.92/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.92/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.92/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.92/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.92/0.58 # Starting sh5l with 300s (1) cores
% 0.92/0.58 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 13324 completed with status 0
% 0.92/0.58 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.92/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.92/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.92/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.92/0.58 # No SInE strategy applied
% 0.92/0.58 # Search class: FGHSM-FSLM33-DFFFFFNN
% 0.92/0.58 # Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.92/0.58 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S with 271s (1) cores
% 0.92/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.92/0.58 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.92/0.58 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.92/0.58 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.92/0.58 # G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 13335 completed with status 0
% 0.92/0.58 # Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 0.92/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.92/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.92/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.92/0.58 # No SInE strategy applied
% 0.92/0.58 # Search class: FGHSM-FSLM33-DFFFFFNN
% 0.92/0.58 # Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.92/0.58 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S with 271s (1) cores
% 0.92/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.92/0.58 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.92/0.58 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.92/0.58 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.92/0.58 # Preprocessing time : 0.007 s
% 0.92/0.58 # Presaturation interreduction done
% 0.92/0.58
% 0.92/0.58 # Proof found!
% 0.92/0.58 # SZS status Unsatisfiable
% 0.92/0.58 # SZS output start CNFRefutation
% See solution above
% 0.92/0.58 # Parsed axioms : 549
% 0.92/0.58 # Removed by relevancy pruning/SinE : 0
% 0.92/0.58 # Initial clauses : 549
% 0.92/0.58 # Removed in clause preprocessing : 6
% 0.92/0.58 # Initial clauses in saturation : 543
% 0.92/0.58 # Processed clauses : 946
% 0.92/0.58 # ...of these trivial : 39
% 0.92/0.58 # ...subsumed : 162
% 0.92/0.58 # ...remaining for further processing : 745
% 0.92/0.58 # Other redundant clauses eliminated : 2
% 0.92/0.58 # Clauses deleted for lack of memory : 0
% 0.92/0.58 # Backward-subsumed : 18
% 0.92/0.58 # Backward-rewritten : 5
% 0.92/0.58 # Generated clauses : 925
% 0.92/0.58 # ...of the previous two non-redundant : 557
% 0.92/0.58 # ...aggressively subsumed : 0
% 0.92/0.58 # Contextual simplify-reflections : 0
% 0.92/0.58 # Paramodulations : 921
% 0.92/0.58 # Factorizations : 0
% 0.92/0.58 # NegExts : 0
% 0.92/0.58 # Equation resolutions : 4
% 0.92/0.58 # Disequality decompositions : 0
% 0.92/0.58 # Total rewrite steps : 545
% 0.92/0.58 # ...of those cached : 309
% 0.92/0.58 # Propositional unsat checks : 0
% 0.92/0.58 # Propositional check models : 0
% 0.92/0.58 # Propositional check unsatisfiable : 0
% 0.92/0.58 # Propositional clauses : 0
% 0.92/0.58 # Propositional clauses after purity: 0
% 0.92/0.58 # Propositional unsat core size : 0
% 0.92/0.58 # Propositional preprocessing time : 0.000
% 0.92/0.58 # Propositional encoding time : 0.000
% 0.92/0.58 # Propositional solver time : 0.000
% 0.92/0.58 # Success case prop preproc time : 0.000
% 0.92/0.58 # Success case prop encoding time : 0.000
% 0.92/0.58 # Success case prop solver time : 0.000
% 0.92/0.58 # Current number of processed clauses : 249
% 0.92/0.58 # Positive orientable unit clauses : 104
% 0.92/0.58 # Positive unorientable unit clauses: 5
% 0.92/0.58 # Negative unit clauses : 16
% 0.92/0.58 # Non-unit-clauses : 124
% 0.92/0.58 # Current number of unprocessed clauses: 615
% 0.92/0.58 # ...number of literals in the above : 1326
% 0.92/0.58 # Current number of archived formulas : 0
% 0.92/0.58 # Current number of archived clauses : 499
% 0.92/0.58 # Clause-clause subsumption calls (NU) : 34145
% 0.92/0.58 # Rec. Clause-clause subsumption calls : 20501
% 0.92/0.58 # Non-unit clause-clause subsumptions : 127
% 0.92/0.58 # Unit Clause-clause subsumption calls : 640
% 0.92/0.58 # Rewrite failures with RHS unbound : 0
% 0.92/0.58 # BW rewrite match attempts : 423
% 0.92/0.58 # BW rewrite match successes : 57
% 0.92/0.58 # Condensation attempts : 0
% 0.92/0.58 # Condensation successes : 0
% 0.92/0.58 # Termbank termtop insertions : 33385
% 0.92/0.58 # Search garbage collected termcells : 1066
% 0.92/0.58
% 0.92/0.58 # -------------------------------------------------
% 0.92/0.58 # User time : 0.076 s
% 0.92/0.58 # System time : 0.009 s
% 0.92/0.58 # Total time : 0.085 s
% 0.92/0.58 # Maximum resident set size: 2928 pages
% 0.92/0.58
% 0.92/0.58 # -------------------------------------------------
% 0.92/0.58 # User time : 0.361 s
% 0.92/0.58 # System time : 0.029 s
% 0.92/0.58 # Total time : 0.390 s
% 0.92/0.58 # Maximum resident set size: 2140 pages
% 0.92/0.58 % E---3.1 exiting
% 0.92/0.58 % E exiting
%------------------------------------------------------------------------------