TSTP Solution File: SCT007-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SCT007-1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:31 EDT 2024
% Result : Unsatisfiable 0.80s 0.63s
% Output : CNFRefutation 0.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 10 ( 7 unt; 0 nHn; 10 RR)
% Number of literals : 13 ( 0 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 13 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_2,negated_conjecture,
~ hBOOL(hAPP(c_Order__Relation_Ostrict__linear__order__on(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oalt,tc_bool)),tc_Arrow__Order__Mirabelle_Oalt),X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_strict__linear__order__on__diff__Id_0,axiom,
( hBOOL(hAPP(c_Order__Relation_Ostrict__linear__order__on(X1,X2),c_HOL_Ominus__class_Ominus(X3,c_Relation_OId(X2),tc_fun(tc_prod(X2,X2),tc_bool))))
| ~ hBOOL(c_Order__Relation_Olinear__order__on(X1,X3,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_strict__linear__order__on__diff__Id_0) ).
cnf(cls_conjecture_0,negated_conjecture,
hBOOL(c_Order__Relation_Olinear__order__on(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oalt,tc_bool)),v_r,tc_Arrow__Order__Mirabelle_Oalt)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_0_3,negated_conjecture,
~ hBOOL(hAPP(c_Order__Relation_Ostrict__linear__order__on(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oalt,tc_bool)),tc_Arrow__Order__Mirabelle_Oalt),X1)),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_4,plain,
( hBOOL(hAPP(c_Order__Relation_Ostrict__linear__order__on(X1,X2),c_HOL_Ominus__class_Ominus(X3,c_Relation_OId(X2),tc_fun(tc_prod(X2,X2),tc_bool))))
| ~ hBOOL(c_Order__Relation_Olinear__order__on(X1,X3,X2)) ),
inference(fof_simplification,[status(thm)],[cls_strict__linear__order__on__diff__Id_0]) ).
cnf(c_0_5,negated_conjecture,
~ hBOOL(hAPP(c_Order__Relation_Ostrict__linear__order__on(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oalt,tc_bool)),tc_Arrow__Order__Mirabelle_Oalt),X1)),
c_0_3 ).
cnf(c_0_6,plain,
( hBOOL(hAPP(c_Order__Relation_Ostrict__linear__order__on(X1,X2),c_HOL_Ominus__class_Ominus(X3,c_Relation_OId(X2),tc_fun(tc_prod(X2,X2),tc_bool))))
| ~ hBOOL(c_Order__Relation_Olinear__order__on(X1,X3,X2)) ),
c_0_4 ).
cnf(c_0_7,negated_conjecture,
hBOOL(c_Order__Relation_Olinear__order__on(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oalt,tc_bool)),v_r,tc_Arrow__Order__Mirabelle_Oalt)),
cls_conjecture_0 ).
cnf(c_0_8,negated_conjecture,
~ hBOOL(c_Order__Relation_Olinear__order__on(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oalt,tc_bool)),X1,tc_Arrow__Order__Mirabelle_Oalt)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_7,c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SCT007-1 : TPTP v8.2.0. Released v4.1.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n013.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Mon May 20 00:05:38 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.80/0.63 # Version: 3.1.0
% 0.80/0.63 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.80/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.80/0.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.80/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.80/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.80/0.63 # Starting sh5l with 300s (1) cores
% 0.80/0.63 # new_bool_1 with pid 16912 completed with status 0
% 0.80/0.63 # Result found by new_bool_1
% 0.80/0.63 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.80/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.80/0.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.80/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.80/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.80/0.63 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.80/0.63 # Search class: FGHSM-FSLF32-MFFFFFNN
% 0.80/0.63 # partial match(1): FGHSM-FSLM32-MFFFFFNN
% 0.80/0.63 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.80/0.63 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 0.80/0.63 # G-E--_303_C18_F1_URBAN_S0Y with pid 16914 completed with status 0
% 0.80/0.63 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 0.80/0.63 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.80/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.80/0.63 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.80/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.80/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.80/0.63 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.80/0.63 # Search class: FGHSM-FSLF32-MFFFFFNN
% 0.80/0.63 # partial match(1): FGHSM-FSLM32-MFFFFFNN
% 0.80/0.63 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.80/0.63 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 0.80/0.63 # Preprocessing time : 0.016 s
% 0.80/0.63
% 0.80/0.63 # Proof found!
% 0.80/0.63 # SZS status Unsatisfiable
% 0.80/0.63 # SZS output start CNFRefutation
% See solution above
% 0.80/0.63 # Parsed axioms : 605
% 0.80/0.63 # Removed by relevancy pruning/SinE : 327
% 0.80/0.63 # Initial clauses : 278
% 0.80/0.63 # Removed in clause preprocessing : 0
% 0.80/0.63 # Initial clauses in saturation : 278
% 0.80/0.63 # Processed clauses : 282
% 0.80/0.63 # ...of these trivial : 14
% 0.80/0.63 # ...subsumed : 16
% 0.80/0.63 # ...remaining for further processing : 252
% 0.80/0.63 # Other redundant clauses eliminated : 1
% 0.80/0.63 # Clauses deleted for lack of memory : 0
% 0.80/0.63 # Backward-subsumed : 0
% 0.80/0.63 # Backward-rewritten : 3
% 0.80/0.63 # Generated clauses : 3603
% 0.80/0.63 # ...of the previous two non-redundant : 2689
% 0.80/0.63 # ...aggressively subsumed : 0
% 0.80/0.63 # Contextual simplify-reflections : 0
% 0.80/0.63 # Paramodulations : 3600
% 0.80/0.63 # Factorizations : 0
% 0.80/0.63 # NegExts : 0
% 0.80/0.63 # Equation resolutions : 2
% 0.80/0.63 # Disequality decompositions : 0
% 0.80/0.63 # Total rewrite steps : 1910
% 0.80/0.63 # ...of those cached : 1102
% 0.80/0.63 # Propositional unsat checks : 0
% 0.80/0.63 # Propositional check models : 0
% 0.80/0.63 # Propositional check unsatisfiable : 0
% 0.80/0.63 # Propositional clauses : 0
% 0.80/0.63 # Propositional clauses after purity: 0
% 0.80/0.63 # Propositional unsat core size : 0
% 0.80/0.63 # Propositional preprocessing time : 0.000
% 0.80/0.63 # Propositional encoding time : 0.000
% 0.80/0.63 # Propositional solver time : 0.000
% 0.80/0.63 # Success case prop preproc time : 0.000
% 0.80/0.63 # Success case prop encoding time : 0.000
% 0.80/0.63 # Success case prop solver time : 0.000
% 0.80/0.63 # Current number of processed clauses : 248
% 0.80/0.63 # Positive orientable unit clauses : 119
% 0.80/0.63 # Positive unorientable unit clauses: 5
% 0.80/0.63 # Negative unit clauses : 5
% 0.80/0.63 # Non-unit-clauses : 119
% 0.80/0.63 # Current number of unprocessed clauses: 2685
% 0.80/0.63 # ...number of literals in the above : 5242
% 0.80/0.63 # Current number of archived formulas : 0
% 0.80/0.63 # Current number of archived clauses : 4
% 0.80/0.63 # Clause-clause subsumption calls (NU) : 4918
% 0.80/0.63 # Rec. Clause-clause subsumption calls : 2959
% 0.80/0.63 # Non-unit clause-clause subsumptions : 10
% 0.80/0.63 # Unit Clause-clause subsumption calls : 113
% 0.80/0.63 # Rewrite failures with RHS unbound : 0
% 0.80/0.63 # BW rewrite match attempts : 58
% 0.80/0.63 # BW rewrite match successes : 40
% 0.80/0.63 # Condensation attempts : 0
% 0.80/0.63 # Condensation successes : 0
% 0.80/0.63 # Termbank termtop insertions : 75950
% 0.80/0.63 # Search garbage collected termcells : 1675
% 0.80/0.63
% 0.80/0.63 # -------------------------------------------------
% 0.80/0.63 # User time : 0.085 s
% 0.80/0.63 # System time : 0.011 s
% 0.80/0.63 # Total time : 0.096 s
% 0.80/0.63 # Maximum resident set size: 2516 pages
% 0.80/0.63
% 0.80/0.63 # -------------------------------------------------
% 0.80/0.63 # User time : 0.100 s
% 0.80/0.63 # System time : 0.012 s
% 0.80/0.63 # Total time : 0.112 s
% 0.80/0.63 # Maximum resident set size: 2152 pages
% 0.80/0.63 % E---3.1 exiting
% 0.80/0.63 % E exiting
%------------------------------------------------------------------------------