TSTP Solution File: SCT080-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SCT080-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:16 EDT 2023
% Result : Unsatisfiable 0.21s 0.76s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 15 ( 10 unt; 0 nHn; 13 RR)
% Number of literals : 22 ( 2 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-4 aty)
% Number of variables : 23 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_PiE_0,axiom,
( hBOOL(hAPP(hAPP(c_in(X4),hAPP(X5,X2)),hAPP(X6,X2)))
| ~ hBOOL(hAPP(hAPP(c_in(X1),X2),X3))
| ~ hBOOL(hAPP(hAPP(c_in(tc_fun(X1,X4)),X5),c_FuncSet_OPi(X3,X6,X1,X4))) ),
file('/export/starexec/sandbox/tmp/tmp.3o1VMzwKIm/E---3.1_10590.p',cls_PiE_0) ).
cnf(cls_CHAINED_0_01,axiom,
hBOOL(hAPP(hAPP(c_in(tc_fun(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))),v_F),c_FuncSet_OPi(c_Arrow__Order__Mirabelle_OProf,c_COMBK(c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_bool),tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))),tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)))),
file('/export/starexec/sandbox/tmp/tmp.3o1VMzwKIm/E---3.1_10590.p',cls_CHAINED_0_01) ).
cnf(cls_COMBK__def_0,axiom,
hAPP(c_COMBK(X1,X2,X3),X4) = X1,
file('/export/starexec/sandbox/tmp/tmp.3o1VMzwKIm/E---3.1_10590.p',cls_COMBK__def_0) ).
cnf(cls_conjecture_0,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_in(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),hAPP(v_F,c_COMBK(v_Lba____,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_Arrow__Order__Mirabelle_Oindi))),c_Arrow__Order__Mirabelle_OLin)),
file('/export/starexec/sandbox/tmp/tmp.3o1VMzwKIm/E---3.1_10590.p',cls_conjecture_0) ).
cnf(cls_const__Lin__Prof_0,axiom,
( hBOOL(hAPP(hAPP(c_in(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))),c_COMBK(X1,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_Arrow__Order__Mirabelle_Oindi)),c_Arrow__Order__Mirabelle_OProf))
| ~ hBOOL(hAPP(hAPP(c_in(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),X1),c_Arrow__Order__Mirabelle_OLin)) ),
file('/export/starexec/sandbox/tmp/tmp.3o1VMzwKIm/E---3.1_10590.p',cls_const__Lin__Prof_0) ).
cnf(cls_CHAINED_0,axiom,
hBOOL(hAPP(hAPP(c_in(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),v_Lba____),c_Arrow__Order__Mirabelle_OLin)),
file('/export/starexec/sandbox/tmp/tmp.3o1VMzwKIm/E---3.1_10590.p',cls_CHAINED_0) ).
cnf(c_0_6,axiom,
( hBOOL(hAPP(hAPP(c_in(X4),hAPP(X5,X2)),hAPP(X6,X2)))
| ~ hBOOL(hAPP(hAPP(c_in(X1),X2),X3))
| ~ hBOOL(hAPP(hAPP(c_in(tc_fun(X1,X4)),X5),c_FuncSet_OPi(X3,X6,X1,X4))) ),
cls_PiE_0 ).
cnf(c_0_7,axiom,
hBOOL(hAPP(hAPP(c_in(tc_fun(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))),v_F),c_FuncSet_OPi(c_Arrow__Order__Mirabelle_OProf,c_COMBK(c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_bool),tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))),tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)))),
cls_CHAINED_0_01 ).
cnf(c_0_8,axiom,
hAPP(c_COMBK(X1,X2,X3),X4) = X1,
cls_COMBK__def_0 ).
cnf(c_0_9,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_in(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),hAPP(v_F,c_COMBK(v_Lba____,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_Arrow__Order__Mirabelle_Oindi))),c_Arrow__Order__Mirabelle_OLin)),
cls_conjecture_0 ).
cnf(c_0_10,plain,
( hBOOL(hAPP(hAPP(c_in(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),hAPP(v_F,X1)),c_Arrow__Order__Mirabelle_OLin))
| ~ hBOOL(hAPP(hAPP(c_in(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))),X1),c_Arrow__Order__Mirabelle_OProf)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_11,negated_conjecture,
~ hBOOL(hAPP(hAPP(c_in(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))),c_COMBK(v_Lba____,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_Arrow__Order__Mirabelle_Oindi)),c_Arrow__Order__Mirabelle_OProf)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
( hBOOL(hAPP(hAPP(c_in(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))),c_COMBK(X1,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool),tc_Arrow__Order__Mirabelle_Oindi)),c_Arrow__Order__Mirabelle_OProf))
| ~ hBOOL(hAPP(hAPP(c_in(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),X1),c_Arrow__Order__Mirabelle_OLin)) ),
cls_const__Lin__Prof_0 ).
cnf(c_0_13,axiom,
hBOOL(hAPP(hAPP(c_in(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),v_Lba____),c_Arrow__Order__Mirabelle_OLin)),
cls_CHAINED_0 ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.12 % Problem : SCT080-1 : TPTP v8.1.2. Released v4.1.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.15/0.34 % Computer : n001.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 2400
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Mon Oct 2 12:13:06 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.55 Running first-order model finding
% 0.21/0.55 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.3o1VMzwKIm/E---3.1_10590.p
% 0.21/0.76 # Version: 3.1pre001
% 0.21/0.76 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.21/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.76 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.21/0.76 # Starting new_bool_3 with 600s (2) cores
% 0.21/0.76 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.76 # Starting sh5l with 300s (1) cores
% 0.21/0.76 # new_bool_1 with pid 10771 completed with status 0
% 0.21/0.76 # Result found by new_bool_1
% 0.21/0.76 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.21/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.76 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.21/0.76 # Starting new_bool_3 with 600s (2) cores
% 0.21/0.76 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.76 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.76 # Search class: FGHSM-FSLS32-DFFFFFNN
% 0.21/0.76 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.76 # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 0.21/0.76 # SAT001_MinMin_p005000_rr_RG with pid 10774 completed with status 0
% 0.21/0.76 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.76 # Preprocessing class: FSLMSMSMSSSNFFN.
% 0.21/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.76 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.21/0.76 # Starting new_bool_3 with 600s (2) cores
% 0.21/0.76 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.76 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.76 # Search class: FGHSM-FSLS32-DFFFFFNN
% 0.21/0.76 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.76 # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 0.21/0.76 # Preprocessing time : 0.006 s
% 0.21/0.76 # Presaturation interreduction done
% 0.21/0.76
% 0.21/0.76 # Proof found!
% 0.21/0.76 # SZS status Unsatisfiable
% 0.21/0.76 # SZS output start CNFRefutation
% See solution above
% 0.21/0.76 # Parsed axioms : 688
% 0.21/0.76 # Removed by relevancy pruning/SinE : 392
% 0.21/0.76 # Initial clauses : 296
% 0.21/0.76 # Removed in clause preprocessing : 0
% 0.21/0.76 # Initial clauses in saturation : 296
% 0.21/0.76 # Processed clauses : 1840
% 0.21/0.76 # ...of these trivial : 34
% 0.21/0.76 # ...subsumed : 1154
% 0.21/0.76 # ...remaining for further processing : 652
% 0.21/0.76 # Other redundant clauses eliminated : 109
% 0.21/0.76 # Clauses deleted for lack of memory : 0
% 0.21/0.76 # Backward-subsumed : 21
% 0.21/0.76 # Backward-rewritten : 11
% 0.21/0.76 # Generated clauses : 6573
% 0.21/0.76 # ...of the previous two non-redundant : 5282
% 0.21/0.76 # ...aggressively subsumed : 0
% 0.21/0.76 # Contextual simplify-reflections : 0
% 0.21/0.76 # Paramodulations : 6458
% 0.21/0.76 # Factorizations : 0
% 0.21/0.76 # NegExts : 0
% 0.21/0.76 # Equation resolutions : 115
% 0.21/0.76 # Total rewrite steps : 2641
% 0.21/0.76 # Propositional unsat checks : 0
% 0.21/0.76 # Propositional check models : 0
% 0.21/0.76 # Propositional check unsatisfiable : 0
% 0.21/0.76 # Propositional clauses : 0
% 0.21/0.76 # Propositional clauses after purity: 0
% 0.21/0.76 # Propositional unsat core size : 0
% 0.21/0.76 # Propositional preprocessing time : 0.000
% 0.21/0.76 # Propositional encoding time : 0.000
% 0.21/0.76 # Propositional solver time : 0.000
% 0.21/0.76 # Success case prop preproc time : 0.000
% 0.21/0.76 # Success case prop encoding time : 0.000
% 0.21/0.76 # Success case prop solver time : 0.000
% 0.21/0.76 # Current number of processed clauses : 384
% 0.21/0.76 # Positive orientable unit clauses : 96
% 0.21/0.76 # Positive unorientable unit clauses: 8
% 0.21/0.76 # Negative unit clauses : 56
% 0.21/0.76 # Non-unit-clauses : 224
% 0.21/0.76 # Current number of unprocessed clauses: 3886
% 0.21/0.76 # ...number of literals in the above : 8040
% 0.21/0.76 # Current number of archived formulas : 0
% 0.21/0.76 # Current number of archived clauses : 268
% 0.21/0.76 # Clause-clause subsumption calls (NU) : 14102
% 0.21/0.76 # Rec. Clause-clause subsumption calls : 12741
% 0.21/0.76 # Non-unit clause-clause subsumptions : 399
% 0.21/0.76 # Unit Clause-clause subsumption calls : 895
% 0.21/0.76 # Rewrite failures with RHS unbound : 0
% 0.21/0.76 # BW rewrite match attempts : 204
% 0.21/0.76 # BW rewrite match successes : 125
% 0.21/0.76 # Condensation attempts : 0
% 0.21/0.76 # Condensation successes : 0
% 0.21/0.76 # Termbank termtop insertions : 138683
% 0.21/0.76
% 0.21/0.76 # -------------------------------------------------
% 0.21/0.76 # User time : 0.149 s
% 0.21/0.76 # System time : 0.011 s
% 0.21/0.76 # Total time : 0.160 s
% 0.21/0.76 # Maximum resident set size: 2792 pages
% 0.21/0.76
% 0.21/0.76 # -------------------------------------------------
% 0.21/0.76 # User time : 0.172 s
% 0.21/0.76 # System time : 0.015 s
% 0.21/0.76 # Total time : 0.187 s
% 0.21/0.76 # Maximum resident set size: 2336 pages
% 0.21/0.76 % E---3.1 exiting
%------------------------------------------------------------------------------