TSTP Solution File: SCT166+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SCT166+1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:05 EDT 2024
% Result : ContradictoryAxioms 0.47s 0.74s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 14 unt; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 42 ( 20 ~; 13 |; 2 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-4 aty)
% Number of variables : 52 ( 2 sgn 33 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_order__less__not__sym,axiom,
! [X20,X21,X10] :
( class_Orderings_Opreorder(X10)
=> ( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(X10),X21),X20))
=> ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(X10),X20),X21)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_order__less__not__sym) ).
fof(fact_lessI,axiom,
! [X46] : hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(tc_Nat_Onat),X46),hAPP(c_Nat_OSuc,X46))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_lessI) ).
fof(arity_Nat__Onat__Orderings_Opreorder,axiom,
class_Orderings_Opreorder(tc_Nat_Onat),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Nat__Onat__Orderings_Opreorder) ).
fof(fact_finite__nat__set__iff__bounded,axiom,
! [X56] :
( c_Finite__Set_Ofinite(tc_Nat_Onat,X56)
<=> ? [X17] :
! [X3] :
( hBOOL(hAPP(hAPP(c_member(tc_Nat_Onat),X3),X56))
=> hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(tc_Nat_Onat),X3),X17)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_finite__nat__set__iff__bounded) ).
fof(fact_rangeI,axiom,
! [X14,X8,X2,X10] : hBOOL(hAPP(hAPP(c_member(X10),hAPP(X2,X8)),c_Set_Oimage(X14,X10,X2,c_Orderings_Otop__class_Otop(tc_fun(X14,tc_HOL_Obool))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_rangeI) ).
fof(fact_finite__imageI,axiom,
! [X65,X14,X40,X10] :
( c_Finite__Set_Ofinite(X10,X40)
=> c_Finite__Set_Ofinite(X14,c_Set_Oimage(X10,X14,X65,X40)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_finite__imageI) ).
fof(fact_finite__indi,axiom,
c_Finite__Set_Ofinite(tc_Arrow__Order__Mirabelle_Oindi,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_HOL_Obool))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_finite__indi) ).
fof(c_0_7,plain,
! [X20,X21,X10] :
( class_Orderings_Opreorder(X10)
=> ( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(X10),X21),X20))
=> ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(X10),X20),X21)) ) ),
inference(fof_simplification,[status(thm)],[fact_order__less__not__sym]) ).
fof(c_0_8,plain,
! [X620,X621,X622] :
( ~ class_Orderings_Opreorder(X622)
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(X622),X621),X620))
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(X622),X620),X621)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_9,plain,
! [X1181] : hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(tc_Nat_Onat),X1181),hAPP(c_Nat_OSuc,X1181))),
inference(variable_rename,[status(thm)],[fact_lessI]) ).
cnf(c_0_10,plain,
( ~ class_Orderings_Opreorder(X1)
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(X1),X2),X3))
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(X1),X3),X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(tc_Nat_Onat),X1),hAPP(c_Nat_OSuc,X1))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
class_Orderings_Opreorder(tc_Nat_Onat),
inference(split_conjunct,[status(thm)],[arity_Nat__Onat__Orderings_Opreorder]) ).
fof(c_0_13,plain,
! [X1603,X1605,X1606,X1607] :
( ( ~ c_Finite__Set_Ofinite(tc_Nat_Onat,X1603)
| ~ hBOOL(hAPP(hAPP(c_member(tc_Nat_Onat),X1605),X1603))
| hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(tc_Nat_Onat),X1605),esk41_1(X1603))) )
& ( hBOOL(hAPP(hAPP(c_member(tc_Nat_Onat),esk42_2(X1606,X1607)),X1606))
| c_Finite__Set_Ofinite(tc_Nat_Onat,X1606) )
& ( ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(tc_Nat_Onat),esk42_2(X1606,X1607)),X1607))
| c_Finite__Set_Ofinite(tc_Nat_Onat,X1606) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_finite__nat__set__iff__bounded])])])])])])]) ).
cnf(c_0_14,plain,
~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(tc_Nat_Onat),hAPP(c_Nat_OSuc,X1)),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_15,plain,
( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(tc_Nat_Onat),X2),esk41_1(X1)))
| ~ c_Finite__Set_Ofinite(tc_Nat_Onat,X1)
| ~ hBOOL(hAPP(hAPP(c_member(tc_Nat_Onat),X2),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X1414,X1415,X1416,X1417] : hBOOL(hAPP(hAPP(c_member(X1417),hAPP(X1416,X1415)),c_Set_Oimage(X1414,X1417,X1416,c_Orderings_Otop__class_Otop(tc_fun(X1414,tc_HOL_Obool))))),
inference(variable_rename,[status(thm)],[fact_rangeI]) ).
cnf(c_0_17,plain,
( ~ c_Finite__Set_Ofinite(tc_Nat_Onat,X1)
| ~ hBOOL(hAPP(hAPP(c_member(tc_Nat_Onat),hAPP(c_Nat_OSuc,esk41_1(X1))),X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
hBOOL(hAPP(hAPP(c_member(X1),hAPP(X2,X3)),c_Set_Oimage(X4,X1,X2,c_Orderings_Otop__class_Otop(tc_fun(X4,tc_HOL_Obool))))),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_19,plain,
! [X1356,X1357,X1358,X1359] :
( ~ c_Finite__Set_Ofinite(X1359,X1358)
| c_Finite__Set_Ofinite(X1357,c_Set_Oimage(X1359,X1357,X1356,X1358)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_finite__imageI])])]) ).
cnf(c_0_20,plain,
~ c_Finite__Set_Ofinite(tc_Nat_Onat,c_Set_Oimage(X1,tc_Nat_Onat,c_Nat_OSuc,c_Orderings_Otop__class_Otop(tc_fun(X1,tc_HOL_Obool)))),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
( c_Finite__Set_Ofinite(X3,c_Set_Oimage(X1,X3,X4,X2))
| ~ c_Finite__Set_Ofinite(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,plain,
c_Finite__Set_Ofinite(tc_Arrow__Order__Mirabelle_Oindi,c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_HOL_Obool))),
inference(split_conjunct,[status(thm)],[fact_finite__indi]) ).
cnf(c_0_23,plain,
~ c_Finite__Set_Ofinite(X1,c_Orderings_Otop__class_Otop(tc_fun(X1,tc_HOL_Obool))),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
$false,
inference(sr,[status(thm)],[c_0_22,c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SCT166+1 : TPTP v8.2.0. Released v5.2.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon May 20 00:02:37 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.47/0.74 # Version: 3.1.0
% 0.47/0.74 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.47/0.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/0.74 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.47/0.74 # Starting new_bool_3 with 300s (1) cores
% 0.47/0.74 # Starting new_bool_1 with 300s (1) cores
% 0.47/0.74 # Starting sh5l with 300s (1) cores
% 0.47/0.74 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 28141 completed with status 0
% 0.47/0.74 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.47/0.74 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.47/0.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/0.74 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.47/0.74 # No SInE strategy applied
% 0.47/0.74 # Search class: FGHSM-FSLM32-DFFFFFNN
% 0.47/0.74 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.47/0.74 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 113s (1) cores
% 0.47/0.74 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.47/0.74 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 113s (1) cores
% 0.47/0.74 # Starting U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 0.47/0.74 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with 113s (1) cores
% 0.47/0.74 # G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with pid 28168 completed with status 0
% 0.47/0.74 # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y
% 0.47/0.74 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.47/0.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/0.74 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.47/0.74 # No SInE strategy applied
% 0.47/0.74 # Search class: FGHSM-FSLM32-DFFFFFNN
% 0.47/0.74 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.47/0.74 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 113s (1) cores
% 0.47/0.74 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.47/0.74 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 113s (1) cores
% 0.47/0.74 # Starting U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 0.47/0.74 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with 113s (1) cores
% 0.47/0.74 # Preprocessing time : 0.018 s
% 0.47/0.74 # Presaturation interreduction done
% 0.47/0.74
% 0.47/0.74 # Proof found!
% 0.47/0.74 # SZS status ContradictoryAxioms
% 0.47/0.74 # SZS output start CNFRefutation
% See solution above
% 0.47/0.74 # Parsed axioms : 533
% 0.47/0.74 # Removed by relevancy pruning/SinE : 0
% 0.47/0.74 # Initial clauses : 879
% 0.47/0.74 # Removed in clause preprocessing : 88
% 0.47/0.74 # Initial clauses in saturation : 791
% 0.47/0.74 # Processed clauses : 1638
% 0.47/0.74 # ...of these trivial : 22
% 0.47/0.74 # ...subsumed : 563
% 0.47/0.74 # ...remaining for further processing : 1053
% 0.47/0.74 # Other redundant clauses eliminated : 72
% 0.47/0.74 # Clauses deleted for lack of memory : 0
% 0.47/0.74 # Backward-subsumed : 7
% 0.47/0.74 # Backward-rewritten : 15
% 0.47/0.74 # Generated clauses : 2089
% 0.47/0.74 # ...of the previous two non-redundant : 1849
% 0.47/0.74 # ...aggressively subsumed : 0
% 0.47/0.74 # Contextual simplify-reflections : 5
% 0.47/0.74 # Paramodulations : 2008
% 0.47/0.74 # Factorizations : 0
% 0.47/0.74 # NegExts : 0
% 0.47/0.74 # Equation resolutions : 86
% 0.47/0.74 # Disequality decompositions : 0
% 0.47/0.74 # Total rewrite steps : 675
% 0.47/0.74 # ...of those cached : 508
% 0.47/0.74 # Propositional unsat checks : 0
% 0.47/0.74 # Propositional check models : 0
% 0.47/0.74 # Propositional check unsatisfiable : 0
% 0.47/0.74 # Propositional clauses : 0
% 0.47/0.74 # Propositional clauses after purity: 0
% 0.47/0.74 # Propositional unsat core size : 0
% 0.47/0.74 # Propositional preprocessing time : 0.000
% 0.47/0.74 # Propositional encoding time : 0.000
% 0.47/0.74 # Propositional solver time : 0.000
% 0.47/0.74 # Success case prop preproc time : 0.000
% 0.47/0.74 # Success case prop encoding time : 0.000
% 0.47/0.74 # Success case prop solver time : 0.000
% 0.47/0.74 # Current number of processed clauses : 397
% 0.47/0.74 # Positive orientable unit clauses : 140
% 0.47/0.74 # Positive unorientable unit clauses: 9
% 0.47/0.74 # Negative unit clauses : 70
% 0.47/0.74 # Non-unit-clauses : 178
% 0.47/0.74 # Current number of unprocessed clauses: 1567
% 0.47/0.74 # ...number of literals in the above : 3091
% 0.47/0.74 # Current number of archived formulas : 0
% 0.47/0.74 # Current number of archived clauses : 592
% 0.47/0.74 # Clause-clause subsumption calls (NU) : 73936
% 0.47/0.74 # Rec. Clause-clause subsumption calls : 20186
% 0.47/0.74 # Non-unit clause-clause subsumptions : 229
% 0.47/0.74 # Unit Clause-clause subsumption calls : 1338
% 0.47/0.74 # Rewrite failures with RHS unbound : 1158
% 0.47/0.74 # BW rewrite match attempts : 1791
% 0.47/0.74 # BW rewrite match successes : 362
% 0.47/0.74 # Condensation attempts : 0
% 0.47/0.74 # Condensation successes : 0
% 0.47/0.74 # Termbank termtop insertions : 158759
% 0.47/0.74 # Search garbage collected termcells : 12262
% 0.47/0.74
% 0.47/0.74 # -------------------------------------------------
% 0.47/0.74 # User time : 0.207 s
% 0.47/0.74 # System time : 0.016 s
% 0.47/0.74 # Total time : 0.223 s
% 0.47/0.74 # Maximum resident set size: 5500 pages
% 0.47/0.74
% 0.47/0.74 # -------------------------------------------------
% 0.47/0.74 # User time : 0.875 s
% 0.47/0.74 # System time : 0.059 s
% 0.47/0.74 # Total time : 0.934 s
% 0.47/0.74 # Maximum resident set size: 2456 pages
% 0.47/0.74 % E---3.1 exiting
% 0.47/0.74 % E exiting
%------------------------------------------------------------------------------