TSTP Solution File: SWV576-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWV576-1 : TPTP v8.1.2. 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:07:27 EDT 2023
% Result : Unsatisfiable 1792.64s 229.02s
% Output : CNFRefutation 1792.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 9
% Syntax : Number of clauses : 22 ( 20 unt; 0 nHn; 12 RR)
% Number of literals : 24 ( 19 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 3 con; 0-3 aty)
% Number of variables : 20 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),c_Suc(c_Suc(c_Suc(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat))))),tc_nat) != c_Set_Oinsert(c_HOL_Ozero__class_Ozero(tc_nat),c_Set_Oinsert(c_HOL_Oone__class_Oone(tc_nat),c_Set_Oinsert(c_Int_Onumber__class_Onumber__of(c_Int_OBit0(c_Int_OBit1(c_Int_OPls)),tc_nat),c_Set_Oinsert(c_Int_Onumber__class_Onumber__of(c_Int_OBit1(c_Int_OBit1(c_Int_OPls)),tc_nat),c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),tc_nat),tc_nat),tc_nat),
file('/export/starexec/sandbox2/tmp/tmp.reMb1g8Nmj/E---3.1_25819.p',cls_conjecture_0) ).
cnf(cls_One__nat__def_0,axiom,
c_HOL_Oone__class_Oone(tc_nat) = c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)),
file('/export/starexec/sandbox2/tmp/tmp.reMb1g8Nmj/E---3.1_25819.p',cls_One__nat__def_0) ).
cnf(cls_comp__arith_I115_J_0,axiom,
c_Suc(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat))) = c_Int_Onumber__class_Onumber__of(c_Int_OBit0(c_Int_OBit1(c_Int_OPls)),tc_nat),
file('/export/starexec/sandbox2/tmp/tmp.reMb1g8Nmj/E---3.1_25819.p',cls_comp__arith_I115_J_0) ).
cnf(cls_numeral__3__eq__3_0,axiom,
c_Int_Onumber__class_Onumber__of(c_Int_OBit1(c_Int_OBit1(c_Int_OPls)),tc_nat) = c_Suc(c_Suc(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)))),
file('/export/starexec/sandbox2/tmp/tmp.reMb1g8Nmj/E---3.1_25819.p',cls_numeral__3__eq__3_0) ).
cnf(cls_atLeastLessThan0_0,axiom,
c_SetInterval_Oord__class_OatLeastLessThan(X1,c_HOL_Ozero__class_Ozero(tc_nat),tc_nat) = c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),
file('/export/starexec/sandbox2/tmp/tmp.reMb1g8Nmj/E---3.1_25819.p',cls_atLeastLessThan0_0) ).
cnf(cls_atLeastLessThanSuc_0,axiom,
( c_SetInterval_Oord__class_OatLeastLessThan(X1,c_Suc(X2),tc_nat) = c_Set_Oinsert(X2,c_SetInterval_Oord__class_OatLeastLessThan(X1,X2,tc_nat),tc_nat)
| ~ c_lessequals(X1,X2,tc_nat) ),
file('/export/starexec/sandbox2/tmp/tmp.reMb1g8Nmj/E---3.1_25819.p',cls_atLeastLessThanSuc_0) ).
cnf(cls_le0_0,axiom,
c_lessequals(c_HOL_Ozero__class_Ozero(tc_nat),X1,tc_nat),
file('/export/starexec/sandbox2/tmp/tmp.reMb1g8Nmj/E---3.1_25819.p',cls_le0_0) ).
cnf(cls_atLeastLessThan__singleton_0,axiom,
c_SetInterval_Oord__class_OatLeastLessThan(X1,c_Suc(X1),tc_nat) = c_Set_Oinsert(X1,c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),
file('/export/starexec/sandbox2/tmp/tmp.reMb1g8Nmj/E---3.1_25819.p',cls_atLeastLessThan__singleton_0) ).
cnf(cls_insert__commute_0,axiom,
c_Set_Oinsert(X1,c_Set_Oinsert(X2,X3,X4),X4) = c_Set_Oinsert(X2,c_Set_Oinsert(X1,X3,X4),X4),
file('/export/starexec/sandbox2/tmp/tmp.reMb1g8Nmj/E---3.1_25819.p',cls_insert__commute_0) ).
cnf(c_0_9,negated_conjecture,
c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),c_Suc(c_Suc(c_Suc(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat))))),tc_nat) != c_Set_Oinsert(c_HOL_Ozero__class_Ozero(tc_nat),c_Set_Oinsert(c_HOL_Oone__class_Oone(tc_nat),c_Set_Oinsert(c_Int_Onumber__class_Onumber__of(c_Int_OBit0(c_Int_OBit1(c_Int_OPls)),tc_nat),c_Set_Oinsert(c_Int_Onumber__class_Onumber__of(c_Int_OBit1(c_Int_OBit1(c_Int_OPls)),tc_nat),c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),tc_nat),tc_nat),tc_nat),
cls_conjecture_0 ).
cnf(c_0_10,axiom,
c_HOL_Oone__class_Oone(tc_nat) = c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)),
cls_One__nat__def_0 ).
cnf(c_0_11,axiom,
c_Suc(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat))) = c_Int_Onumber__class_Onumber__of(c_Int_OBit0(c_Int_OBit1(c_Int_OPls)),tc_nat),
cls_comp__arith_I115_J_0 ).
cnf(c_0_12,axiom,
c_Int_Onumber__class_Onumber__of(c_Int_OBit1(c_Int_OBit1(c_Int_OPls)),tc_nat) = c_Suc(c_Suc(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)))),
cls_numeral__3__eq__3_0 ).
cnf(c_0_13,axiom,
c_SetInterval_Oord__class_OatLeastLessThan(X1,c_HOL_Ozero__class_Ozero(tc_nat),tc_nat) = c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),
cls_atLeastLessThan0_0 ).
cnf(c_0_14,axiom,
( c_SetInterval_Oord__class_OatLeastLessThan(X1,c_Suc(X2),tc_nat) = c_Set_Oinsert(X2,c_SetInterval_Oord__class_OatLeastLessThan(X1,X2,tc_nat),tc_nat)
| ~ c_lessequals(X1,X2,tc_nat) ),
cls_atLeastLessThanSuc_0 ).
cnf(c_0_15,axiom,
c_lessequals(c_HOL_Ozero__class_Ozero(tc_nat),X1,tc_nat),
cls_le0_0 ).
cnf(c_0_16,axiom,
c_SetInterval_Oord__class_OatLeastLessThan(X1,c_Suc(X1),tc_nat) = c_Set_Oinsert(X1,c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),
cls_atLeastLessThan__singleton_0 ).
cnf(c_0_17,negated_conjecture,
c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),c_Suc(c_Suc(c_Suc(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat))))),tc_nat) != c_Set_Oinsert(c_HOL_Ozero__class_Ozero(tc_nat),c_Set_Oinsert(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)),c_Set_Oinsert(c_Suc(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat))),c_Set_Oinsert(c_Suc(c_Suc(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)))),c_SetInterval_Oord__class_OatLeastLessThan(tc_nat,c_HOL_Ozero__class_Ozero(tc_nat),tc_nat),tc_nat),tc_nat),tc_nat),tc_nat),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]),c_0_13]) ).
cnf(c_0_18,plain,
c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),c_Suc(X1),tc_nat) = c_Set_Oinsert(X1,c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),X1,tc_nat),tc_nat),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
c_SetInterval_Oord__class_OatLeastLessThan(X1,c_Suc(X1),tc_nat) = c_Set_Oinsert(X1,c_SetInterval_Oord__class_OatLeastLessThan(tc_nat,c_HOL_Ozero__class_Ozero(tc_nat),tc_nat),tc_nat),
inference(rw,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_20,axiom,
c_Set_Oinsert(X1,c_Set_Oinsert(X2,X3,X4),X4) = c_Set_Oinsert(X2,c_Set_Oinsert(X1,X3,X4),X4),
cls_insert__commute_0 ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_18]),c_0_18]),c_0_19]),c_0_20]),c_0_20]),c_0_20]),c_0_20]),c_0_20]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV576-1 : TPTP v8.1.2. Released v4.1.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 03:47:44 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.63 Running first-order model finding
% 0.21/0.63 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.reMb1g8Nmj/E---3.1_25819.p
% 1792.64/229.02 # Version: 3.1pre001
% 1792.64/229.02 # Preprocessing class: FMLSSMSSSSSNFFN.
% 1792.64/229.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1792.64/229.02 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 900s (3) cores
% 1792.64/229.02 # Starting new_bool_3 with 600s (2) cores
% 1792.64/229.02 # Starting new_bool_1 with 600s (2) cores
% 1792.64/229.02 # Starting sh5l with 300s (1) cores
% 1792.64/229.02 # sh5l with pid 25899 completed with status 0
% 1792.64/229.02 # Result found by sh5l
% 1792.64/229.02 # Preprocessing class: FMLSSMSSSSSNFFN.
% 1792.64/229.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1792.64/229.02 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 900s (3) cores
% 1792.64/229.02 # Starting new_bool_3 with 600s (2) cores
% 1792.64/229.02 # Starting new_bool_1 with 600s (2) cores
% 1792.64/229.02 # Starting sh5l with 300s (1) cores
% 1792.64/229.02 # SinE strategy is gf500_gu_R04_F100_L20000
% 1792.64/229.02 # Search class: FGHSM-SSLM31-DFFFFFNN
% 1792.64/229.02 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1792.64/229.02 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 163s (1) cores
% 1792.64/229.02 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 25904 completed with status 7
% 1792.64/229.02 # Starting sh5l with 31s (1) cores
% 1792.64/229.02 # sh5l with pid 26728 completed with status 7
% 1792.64/229.02 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 28s (1) cores
% 1792.64/229.02 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 26733 completed with status 7
% 1792.64/229.02 # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 1792.64/229.02 # G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 26736 completed with status 0
% 1792.64/229.02 # Result found by G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 1792.64/229.02 # Preprocessing class: FMLSSMSSSSSNFFN.
% 1792.64/229.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1792.64/229.02 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 900s (3) cores
% 1792.64/229.02 # Starting new_bool_3 with 600s (2) cores
% 1792.64/229.02 # Starting new_bool_1 with 600s (2) cores
% 1792.64/229.02 # Starting sh5l with 300s (1) cores
% 1792.64/229.02 # SinE strategy is gf500_gu_R04_F100_L20000
% 1792.64/229.02 # Search class: FGHSM-SSLM31-DFFFFFNN
% 1792.64/229.02 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1792.64/229.02 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 163s (1) cores
% 1792.64/229.02 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 25904 completed with status 7
% 1792.64/229.02 # Starting sh5l with 31s (1) cores
% 1792.64/229.02 # sh5l with pid 26728 completed with status 7
% 1792.64/229.02 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 28s (1) cores
% 1792.64/229.02 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 26733 completed with status 7
% 1792.64/229.02 # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 1792.64/229.02 # Preprocessing time : 0.017 s
% 1792.64/229.02 # Presaturation interreduction done
% 1792.64/229.02
% 1792.64/229.02 # Proof found!
% 1792.64/229.02 # SZS status Unsatisfiable
% 1792.64/229.02 # SZS output start CNFRefutation
% See solution above
% 1792.64/229.02 # Parsed axioms : 1458
% 1792.64/229.02 # Removed by relevancy pruning/SinE : 231
% 1792.64/229.02 # Initial clauses : 1227
% 1792.64/229.02 # Removed in clause preprocessing : 0
% 1792.64/229.02 # Initial clauses in saturation : 1227
% 1792.64/229.02 # Processed clauses : 2537
% 1792.64/229.02 # ...of these trivial : 44
% 1792.64/229.02 # ...subsumed : 1099
% 1792.64/229.02 # ...remaining for further processing : 1394
% 1792.64/229.02 # Other redundant clauses eliminated : 17
% 1792.64/229.02 # Clauses deleted for lack of memory : 0
% 1792.64/229.02 # Backward-subsumed : 26
% 1792.64/229.02 # Backward-rewritten : 41
% 1792.64/229.02 # Generated clauses : 3331
% 1792.64/229.02 # ...of the previous two non-redundant : 2763
% 1792.64/229.02 # ...aggressively subsumed : 0
% 1792.64/229.02 # Contextual simplify-reflections : 3
% 1792.64/229.02 # Paramodulations : 3310
% 1792.64/229.02 # Factorizations : 0
% 1792.64/229.02 # NegExts : 0
% 1792.64/229.02 # Equation resolutions : 21
% 1792.64/229.02 # Total rewrite steps : 2382
% 1792.64/229.02 # Propositional unsat checks : 0
% 1792.64/229.02 # Propositional check models : 0
% 1792.64/229.02 # Propositional check unsatisfiable : 0
% 1792.64/229.02 # Propositional clauses : 0
% 1792.64/229.02 # Propositional clauses after purity: 0
% 1792.64/229.02 # Propositional unsat core size : 0
% 1792.64/229.02 # Propositional preprocessing time : 0.000
% 1792.64/229.02 # Propositional encoding time : 0.000
% 1792.64/229.02 # Propositional solver time : 0.000
% 1792.64/229.02 # Success case prop preproc time : 0.000
% 1792.64/229.02 # Success case prop encoding time : 0.000
% 1792.64/229.02 # Success case prop solver time : 0.000
% 1792.64/229.02 # Current number of processed clauses : 453
% 1792.64/229.02 # Positive orientable unit clauses : 140
% 1792.64/229.02 # Positive unorientable unit clauses: 8
% 1792.64/229.02 # Negative unit clauses : 110
% 1792.64/229.02 # Non-unit-clauses : 195
% 1792.64/229.02 # Current number of unprocessed clauses: 2311
% 1792.64/229.02 # ...number of literals in the above : 4546
% 1792.64/229.02 # Current number of archived formulas : 0
% 1792.64/229.02 # Current number of archived clauses : 941
% 1792.64/229.02 # Clause-clause subsumption calls (NU) : 65877
% 1792.64/229.02 # Rec. Clause-clause subsumption calls : 31556
% 1792.64/229.02 # Non-unit clause-clause subsumptions : 384
% 1792.64/229.02 # Unit Clause-clause subsumption calls : 1385
% 1792.64/229.02 # Rewrite failures with RHS unbound : 0
% 1792.64/229.02 # BW rewrite match attempts : 652
% 1792.64/229.02 # BW rewrite match successes : 211
% 1792.64/229.02 # Condensation attempts : 0
% 1792.64/229.02 # Condensation successes : 0
% 1792.64/229.02 # Termbank termtop insertions : 111009
% 1792.64/229.02
% 1792.64/229.02 # -------------------------------------------------
% 1792.64/229.02 # User time : 219.616 s
% 1792.64/229.02 # System time : 2.917 s
% 1792.64/229.02 # Total time : 222.533 s
% 1792.64/229.02 # Maximum resident set size: 4372 pages
% 1792.64/229.02
% 1792.64/229.02 # -------------------------------------------------
% 1792.64/229.02 # User time : 219.653 s
% 1792.64/229.02 # System time : 2.917 s
% 1792.64/229.02 # Total time : 222.571 s
% 1792.64/229.02 # Maximum resident set size: 2744 pages
% 1792.64/229.02 % E---3.1 exiting
%------------------------------------------------------------------------------