TSTP Solution File: SCT023-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SCT023-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:17:08 EDT 2023
% Result : Unsatisfiable 0.34s 0.68s
% Output : CNFRefutation 0.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 11 unt; 4 nHn; 17 RR)
% Number of literals : 35 ( 6 equ; 15 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-4 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_trans__def_0,axiom,
( c_in(c_Pair(X1,X2,X3,X3),X4,tc_prod(X3,X3))
| ~ c_in(c_Pair(X5,X2,X3,X3),X4,tc_prod(X3,X3))
| ~ c_in(c_Pair(X1,X5,X3,X3),X4,tc_prod(X3,X3))
| ~ c_Relation_Otrans(X4,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.oHlW2KWLdD/E---3.1_3968.p',cls_trans__def_0) ).
cnf(cls_conjecture_2,negated_conjecture,
c_in(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
file('/export/starexec/sandbox2/tmp/tmp.oHlW2KWLdD/E---3.1_3968.p',cls_conjecture_2) ).
cnf(cls_conjecture_3,negated_conjecture,
c_Relation_Otrans(v_F(v_P),tc_Arrow__Order__Mirabelle_Oalt),
file('/export/starexec/sandbox2/tmp/tmp.oHlW2KWLdD/E---3.1_3968.p',cls_conjecture_3) ).
cnf(cls_conjecture_4,negated_conjecture,
~ c_in(c_Pair(X1,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
file('/export/starexec/sandbox2/tmp/tmp.oHlW2KWLdD/E---3.1_3968.p',cls_conjecture_4) ).
cnf(cls_conjecture_8,negated_conjecture,
( c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| X1 = X2
| ~ c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,v_i),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
file('/export/starexec/sandbox2/tmp/tmp.oHlW2KWLdD/E---3.1_3968.p',cls_conjecture_8) ).
cnf(cls_conjecture_6,negated_conjecture,
( c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,X3),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| c_in(c_Pair(X2,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,X3),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| X2 = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.oHlW2KWLdD/E---3.1_3968.p',cls_conjecture_6) ).
cnf(cls_conjecture_5,negated_conjecture,
~ c_in(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,v_i),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
file('/export/starexec/sandbox2/tmp/tmp.oHlW2KWLdD/E---3.1_3968.p',cls_conjecture_5) ).
cnf(c_0_7,axiom,
( c_in(c_Pair(X1,X2,X3,X3),X4,tc_prod(X3,X3))
| ~ c_in(c_Pair(X5,X2,X3,X3),X4,tc_prod(X3,X3))
| ~ c_in(c_Pair(X1,X5,X3,X3),X4,tc_prod(X3,X3))
| ~ c_Relation_Otrans(X4,X3) ),
cls_trans__def_0 ).
cnf(c_0_8,negated_conjecture,
c_in(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
cls_conjecture_2 ).
cnf(c_0_9,negated_conjecture,
c_Relation_Otrans(v_F(v_P),tc_Arrow__Order__Mirabelle_Oalt),
cls_conjecture_3 ).
cnf(c_0_10,negated_conjecture,
~ c_in(c_Pair(X1,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
cls_conjecture_4 ).
cnf(c_0_11,negated_conjecture,
( c_in(c_Pair(X1,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| ~ c_in(c_Pair(X1,v_a,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),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_7,c_0_8]),c_0_9])]) ).
cnf(c_0_12,negated_conjecture,
~ c_in(c_Pair(v_b,v_a,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,negated_conjecture,
( c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| X1 = X2
| ~ c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,v_i),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
cls_conjecture_8 ).
cnf(c_0_14,negated_conjecture,
( v_b = v_a
| ~ c_in(c_Pair(v_b,v_a,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,v_i),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,negated_conjecture,
( c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,X3),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| c_in(c_Pair(X2,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,X3),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| X2 = X1 ),
cls_conjecture_6 ).
cnf(c_0_16,negated_conjecture,
~ c_in(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,v_i),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
cls_conjecture_5 ).
cnf(c_0_17,negated_conjecture,
v_b = v_a,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_17]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SCT023-1 : TPTP v8.1.2. Released v4.1.0.
% 0.10/0.10 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n008.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 11:27:58 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.49 Running first-order model finding
% 0.16/0.49 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.oHlW2KWLdD/E---3.1_3968.p
% 0.34/0.68 # Version: 3.1pre001
% 0.34/0.68 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.34/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.68 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.34/0.68 # Starting new_bool_3 with 300s (1) cores
% 0.34/0.68 # Starting new_bool_1 with 300s (1) cores
% 0.34/0.68 # Starting sh5l with 300s (1) cores
% 0.34/0.68 # new_bool_1 with pid 4117 completed with status 0
% 0.34/0.68 # Result found by new_bool_1
% 0.34/0.68 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.34/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.68 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.34/0.68 # Starting new_bool_3 with 300s (1) cores
% 0.34/0.68 # Starting new_bool_1 with 300s (1) cores
% 0.34/0.68 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.34/0.68 # Search class: FGHSM-FSLF32-MFFFFFNN
% 0.34/0.68 # partial match(1): FGHSM-FSLM32-MFFFFFNN
% 0.34/0.68 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.34/0.68 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 0.34/0.68 # G-E--_303_C18_F1_URBAN_S0Y with pid 4120 completed with status 0
% 0.34/0.68 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 0.34/0.68 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.34/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.68 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.34/0.68 # Starting new_bool_3 with 300s (1) cores
% 0.34/0.68 # Starting new_bool_1 with 300s (1) cores
% 0.34/0.68 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.34/0.68 # Search class: FGHSM-FSLF32-MFFFFFNN
% 0.34/0.68 # partial match(1): FGHSM-FSLM32-MFFFFFNN
% 0.34/0.68 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.34/0.68 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 0.34/0.68 # Preprocessing time : 0.047 s
% 0.34/0.68
% 0.34/0.68 # Proof found!
% 0.34/0.68 # SZS status Unsatisfiable
% 0.34/0.68 # SZS output start CNFRefutation
% See solution above
% 0.34/0.68 # Parsed axioms : 605
% 0.34/0.68 # Removed by relevancy pruning/SinE : 273
% 0.34/0.68 # Initial clauses : 332
% 0.34/0.68 # Removed in clause preprocessing : 0
% 0.34/0.68 # Initial clauses in saturation : 332
% 0.34/0.68 # Processed clauses : 435
% 0.34/0.68 # ...of these trivial : 19
% 0.34/0.68 # ...subsumed : 87
% 0.34/0.68 # ...remaining for further processing : 329
% 0.34/0.68 # Other redundant clauses eliminated : 1
% 0.34/0.68 # Clauses deleted for lack of memory : 0
% 0.34/0.68 # Backward-subsumed : 1
% 0.34/0.68 # Backward-rewritten : 6
% 0.34/0.68 # Generated clauses : 4385
% 0.34/0.68 # ...of the previous two non-redundant : 3668
% 0.34/0.68 # ...aggressively subsumed : 0
% 0.34/0.68 # Contextual simplify-reflections : 2
% 0.34/0.68 # Paramodulations : 4373
% 0.34/0.68 # Factorizations : 4
% 0.34/0.68 # NegExts : 0
% 0.34/0.68 # Equation resolutions : 8
% 0.34/0.68 # Total rewrite steps : 1683
% 0.34/0.68 # Propositional unsat checks : 0
% 0.34/0.68 # Propositional check models : 0
% 0.34/0.68 # Propositional check unsatisfiable : 0
% 0.34/0.68 # Propositional clauses : 0
% 0.34/0.68 # Propositional clauses after purity: 0
% 0.34/0.68 # Propositional unsat core size : 0
% 0.34/0.68 # Propositional preprocessing time : 0.000
% 0.34/0.68 # Propositional encoding time : 0.000
% 0.34/0.68 # Propositional solver time : 0.000
% 0.34/0.68 # Success case prop preproc time : 0.000
% 0.34/0.68 # Success case prop encoding time : 0.000
% 0.34/0.68 # Success case prop solver time : 0.000
% 0.34/0.68 # Current number of processed clauses : 322
% 0.34/0.68 # Positive orientable unit clauses : 113
% 0.34/0.68 # Positive unorientable unit clauses: 6
% 0.34/0.68 # Negative unit clauses : 12
% 0.34/0.68 # Non-unit-clauses : 191
% 0.34/0.68 # Current number of unprocessed clauses: 3562
% 0.34/0.68 # ...number of literals in the above : 7674
% 0.34/0.68 # Current number of archived formulas : 0
% 0.34/0.68 # Current number of archived clauses : 7
% 0.34/0.68 # Clause-clause subsumption calls (NU) : 6282
% 0.34/0.68 # Rec. Clause-clause subsumption calls : 5586
% 0.34/0.68 # Non-unit clause-clause subsumptions : 56
% 0.34/0.68 # Unit Clause-clause subsumption calls : 555
% 0.34/0.68 # Rewrite failures with RHS unbound : 0
% 0.34/0.68 # BW rewrite match attempts : 59
% 0.34/0.68 # BW rewrite match successes : 40
% 0.34/0.68 # Condensation attempts : 0
% 0.34/0.68 # Condensation successes : 0
% 0.34/0.68 # Termbank termtop insertions : 89305
% 0.34/0.68
% 0.34/0.68 # -------------------------------------------------
% 0.34/0.68 # User time : 0.140 s
% 0.34/0.68 # System time : 0.014 s
% 0.34/0.68 # Total time : 0.155 s
% 0.34/0.68 # Maximum resident set size: 2612 pages
% 0.34/0.68
% 0.34/0.68 # -------------------------------------------------
% 0.34/0.68 # User time : 0.157 s
% 0.34/0.68 # System time : 0.017 s
% 0.34/0.68 # Total time : 0.174 s
% 0.34/0.68 # Maximum resident set size: 2148 pages
% 0.34/0.68 % E---3.1 exiting
%------------------------------------------------------------------------------