TSTP Solution File: SCT168+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SCT168+1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:16:54 EDT 2023
% Result : ContradictoryAxioms 0.50s 0.83s
% Output : CNFRefutation 0.50s
% 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,
! [X33,X31,X10] :
( class_Orderings_Opreorder(X10)
=> ( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(X10),X31),X33))
=> ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(X10),X33),X31)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.tNiU6fopjA/E---3.1_15632.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/sandbox2/tmp/tmp.tNiU6fopjA/E---3.1_15632.p',fact_lessI) ).
fof(arity_Nat__Onat__Orderings_Opreorder,axiom,
class_Orderings_Opreorder(tc_Nat_Onat),
file('/export/starexec/sandbox2/tmp/tmp.tNiU6fopjA/E---3.1_15632.p',arity_Nat__Onat__Orderings_Opreorder) ).
fof(fact_finite__nat__set__iff__bounded,axiom,
! [X55] :
( c_Finite__Set_Ofinite(tc_Nat_Onat,X55)
<=> ? [X20] :
! [X3] :
( hBOOL(hAPP(hAPP(c_member(tc_Nat_Onat),X3),X55))
=> hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(tc_Nat_Onat),X3),X20)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.tNiU6fopjA/E---3.1_15632.p',fact_finite__nat__set__iff__bounded) ).
fof(fact_rangeI,axiom,
! [X15,X8,X2,X10] : hBOOL(hAPP(hAPP(c_member(X10),hAPP(X2,X8)),c_Set_Oimage(X15,X10,X2,c_Orderings_Otop__class_Otop(tc_fun(X15,tc_HOL_Obool))))),
file('/export/starexec/sandbox2/tmp/tmp.tNiU6fopjA/E---3.1_15632.p',fact_rangeI) ).
fof(fact_finite__imageI,axiom,
! [X65,X15,X27,X10] :
( c_Finite__Set_Ofinite(X10,X27)
=> c_Finite__Set_Ofinite(X15,c_Set_Oimage(X10,X15,X65,X27)) ),
file('/export/starexec/sandbox2/tmp/tmp.tNiU6fopjA/E---3.1_15632.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/sandbox2/tmp/tmp.tNiU6fopjA/E---3.1_15632.p',fact_finite__indi) ).
fof(c_0_7,plain,
! [X33,X31,X10] :
( class_Orderings_Opreorder(X10)
=> ( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(X10),X31),X33))
=> ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(X10),X33),X31)) ) ),
inference(fof_simplification,[status(thm)],[fact_order__less__not__sym]) ).
fof(c_0_8,plain,
! [X393,X394,X395] :
( ~ class_Orderings_Opreorder(X395)
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(X395),X394),X393))
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(X395),X393),X394)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
fof(c_0_9,plain,
! [X1189] : hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(tc_Nat_Onat),X1189),hAPP(c_Nat_OSuc,X1189))),
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,
! [X1609,X1611,X1612,X1613] :
( ( ~ c_Finite__Set_Ofinite(tc_Nat_Onat,X1609)
| ~ hBOOL(hAPP(hAPP(c_member(tc_Nat_Onat),X1611),X1609))
| hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(tc_Nat_Onat),X1611),esk42_1(X1609))) )
& ( hBOOL(hAPP(hAPP(c_member(tc_Nat_Onat),esk43_2(X1612,X1613)),X1612))
| c_Finite__Set_Ofinite(tc_Nat_Onat,X1612) )
& ( ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(tc_Nat_Onat),esk43_2(X1612,X1613)),X1613))
| c_Finite__Set_Ofinite(tc_Nat_Onat,X1612) ) ),
inference(distribute,[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),esk42_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,
! [X1393,X1394,X1395,X1396] : hBOOL(hAPP(hAPP(c_member(X1396),hAPP(X1395,X1394)),c_Set_Oimage(X1393,X1396,X1395,c_Orderings_Otop__class_Otop(tc_fun(X1393,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,esk42_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,
! [X1362,X1363,X1364,X1365] :
( ~ c_Finite__Set_Ofinite(X1365,X1364)
| c_Finite__Set_Ofinite(X1363,c_Set_Oimage(X1365,X1363,X1362,X1364)) ),
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.10/0.17 % Problem : SCT168+1 : TPTP v8.1.2. Released v5.2.0.
% 0.10/0.18 % Command : run_E %s %d THM
% 0.17/0.38 % Computer : n005.cluster.edu
% 0.17/0.38 % Model : x86_64 x86_64
% 0.17/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.38 % Memory : 8042.1875MB
% 0.17/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.38 % CPULimit : 2400
% 0.17/0.38 % WCLimit : 300
% 0.17/0.38 % DateTime : Mon Oct 2 11:25:16 EDT 2023
% 0.17/0.38 % CPUTime :
% 0.23/0.55 Running first-order theorem proving
% 0.23/0.55 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/tmp/tmp.tNiU6fopjA/E---3.1_15632.p
% 0.50/0.83 # Version: 3.1pre001
% 0.50/0.83 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.50/0.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.83 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.50/0.83 # Starting new_bool_3 with 300s (1) cores
% 0.50/0.83 # Starting new_bool_1 with 300s (1) cores
% 0.50/0.83 # Starting sh5l with 300s (1) cores
% 0.50/0.83 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 15710 completed with status 0
% 0.50/0.83 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.50/0.83 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.50/0.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.83 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.50/0.83 # No SInE strategy applied
% 0.50/0.83 # Search class: FGHSM-FSLM32-DFFFFFNN
% 0.50/0.83 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.50/0.83 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 113s (1) cores
% 0.50/0.83 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.50/0.83 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 113s (1) cores
% 0.50/0.83 # Starting U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 0.50/0.83 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with 113s (1) cores
% 0.50/0.83 # G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with pid 15721 completed with status 0
% 0.50/0.83 # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y
% 0.50/0.83 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.50/0.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.83 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.50/0.83 # No SInE strategy applied
% 0.50/0.83 # Search class: FGHSM-FSLM32-DFFFFFNN
% 0.50/0.83 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.50/0.83 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 113s (1) cores
% 0.50/0.83 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.50/0.83 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 113s (1) cores
% 0.50/0.83 # Starting U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 0.50/0.83 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y with 113s (1) cores
% 0.50/0.83 # Preprocessing time : 0.014 s
% 0.50/0.83 # Presaturation interreduction done
% 0.50/0.83
% 0.50/0.83 # Proof found!
% 0.50/0.83 # SZS status ContradictoryAxioms
% 0.50/0.83 # SZS output start CNFRefutation
% See solution above
% 0.50/0.83 # Parsed axioms : 533
% 0.50/0.83 # Removed by relevancy pruning/SinE : 0
% 0.50/0.83 # Initial clauses : 865
% 0.50/0.83 # Removed in clause preprocessing : 77
% 0.50/0.83 # Initial clauses in saturation : 788
% 0.50/0.83 # Processed clauses : 1714
% 0.50/0.83 # ...of these trivial : 31
% 0.50/0.83 # ...subsumed : 601
% 0.50/0.83 # ...remaining for further processing : 1082
% 0.50/0.83 # Other redundant clauses eliminated : 72
% 0.50/0.83 # Clauses deleted for lack of memory : 0
% 0.50/0.83 # Backward-subsumed : 9
% 0.50/0.83 # Backward-rewritten : 17
% 0.50/0.83 # Generated clauses : 2324
% 0.50/0.83 # ...of the previous two non-redundant : 2070
% 0.50/0.83 # ...aggressively subsumed : 0
% 0.50/0.83 # Contextual simplify-reflections : 6
% 0.50/0.83 # Paramodulations : 2241
% 0.50/0.83 # Factorizations : 2
% 0.50/0.83 # NegExts : 0
% 0.50/0.83 # Equation resolutions : 86
% 0.50/0.83 # Total rewrite steps : 743
% 0.50/0.83 # Propositional unsat checks : 0
% 0.50/0.83 # Propositional check models : 0
% 0.50/0.83 # Propositional check unsatisfiable : 0
% 0.50/0.83 # Propositional clauses : 0
% 0.50/0.83 # Propositional clauses after purity: 0
% 0.50/0.83 # Propositional unsat core size : 0
% 0.50/0.83 # Propositional preprocessing time : 0.000
% 0.50/0.83 # Propositional encoding time : 0.000
% 0.50/0.83 # Propositional solver time : 0.000
% 0.50/0.83 # Success case prop preproc time : 0.000
% 0.50/0.83 # Success case prop encoding time : 0.000
% 0.50/0.83 # Success case prop solver time : 0.000
% 0.50/0.83 # Current number of processed clauses : 422
% 0.50/0.83 # Positive orientable unit clauses : 144
% 0.50/0.83 # Positive unorientable unit clauses: 9
% 0.50/0.83 # Negative unit clauses : 86
% 0.50/0.83 # Non-unit-clauses : 183
% 0.50/0.83 # Current number of unprocessed clauses: 1696
% 0.50/0.83 # ...number of literals in the above : 3243
% 0.50/0.83 # Current number of archived formulas : 0
% 0.50/0.83 # Current number of archived clauses : 596
% 0.50/0.83 # Clause-clause subsumption calls (NU) : 81031
% 0.50/0.83 # Rec. Clause-clause subsumption calls : 18608
% 0.50/0.83 # Non-unit clause-clause subsumptions : 226
% 0.50/0.83 # Unit Clause-clause subsumption calls : 1930
% 0.50/0.83 # Rewrite failures with RHS unbound : 1233
% 0.50/0.83 # BW rewrite match attempts : 1699
% 0.50/0.83 # BW rewrite match successes : 392
% 0.50/0.83 # Condensation attempts : 0
% 0.50/0.83 # Condensation successes : 0
% 0.50/0.83 # Termbank termtop insertions : 158952
% 0.50/0.83
% 0.50/0.83 # -------------------------------------------------
% 0.50/0.83 # User time : 0.223 s
% 0.50/0.83 # System time : 0.014 s
% 0.50/0.83 # Total time : 0.237 s
% 0.50/0.83 # Maximum resident set size: 5444 pages
% 0.50/0.83
% 0.50/0.83 # -------------------------------------------------
% 0.50/0.83 # User time : 0.994 s
% 0.50/0.83 # System time : 0.058 s
% 0.50/0.83 # Total time : 1.053 s
% 0.50/0.83 # Maximum resident set size: 2448 pages
% 0.50/0.83 % E---3.1 exiting
% 0.50/0.84 % E---3.1 exiting
%------------------------------------------------------------------------------