TSTP Solution File: NUM394+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM394+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:07:00 EDT 2023
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 51 ( 12 unt; 0 def)
% Number of atoms : 142 ( 8 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 158 ( 67 ~; 61 |; 14 &)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 79 ( 4 sgn; 47 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t26_ordinal1,conjecture,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( ordinal_subset(X1,X2)
| in(X2,X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qlsgdbL09L/E---3.1_25855.p',t26_ordinal1) ).
fof(connectedness_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
| ordinal_subset(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qlsgdbL09L/E---3.1_25855.p',connectedness_r1_ordinal1) ).
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( in(X1,X2)
& element(X2,powerset(X3)) )
=> element(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.qlsgdbL09L/E---3.1_25855.p',t4_subset) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.qlsgdbL09L/E---3.1_25855.p',t3_subset) ).
fof(redefinition_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
<=> subset(X1,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qlsgdbL09L/E---3.1_25855.p',redefinition_r1_ordinal1) ).
fof(t5_subset,axiom,
! [X1,X2,X3] :
~ ( in(X1,X2)
& element(X2,powerset(X3))
& empty(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.qlsgdbL09L/E---3.1_25855.p',t5_subset) ).
fof(t24_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ~ ( ~ in(X1,X2)
& X1 != X2
& ~ in(X2,X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qlsgdbL09L/E---3.1_25855.p',t24_ordinal1) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.qlsgdbL09L/E---3.1_25855.p',t2_subset) ).
fof(antisymmetry_r2_hidden,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.qlsgdbL09L/E---3.1_25855.p',antisymmetry_r2_hidden) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.qlsgdbL09L/E---3.1_25855.p',reflexivity_r1_tarski) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( ordinal_subset(X1,X2)
| in(X2,X1) ) ) ),
inference(assume_negation,[status(cth)],[t26_ordinal1]) ).
fof(c_0_11,plain,
! [X16,X17] :
( ~ ordinal(X16)
| ~ ordinal(X17)
| ordinal_subset(X16,X17)
| ordinal_subset(X17,X16) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[connectedness_r1_ordinal1])]) ).
fof(c_0_12,negated_conjecture,
( ordinal(esk1_0)
& ordinal(esk2_0)
& ~ ordinal_subset(esk1_0,esk2_0)
& ~ in(esk2_0,esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_13,plain,
( ordinal_subset(X1,X2)
| ordinal_subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
ordinal(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X41,X42,X43] :
( ~ in(X41,X42)
| ~ element(X42,powerset(X43))
| element(X41,X43) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])]) ).
fof(c_0_16,plain,
! [X36,X37] :
( ( ~ element(X36,powerset(X37))
| subset(X36,X37) )
& ( ~ subset(X36,X37)
| element(X36,powerset(X37)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])]) ).
fof(c_0_17,plain,
! [X18,X19] :
( ( ~ ordinal_subset(X18,X19)
| subset(X18,X19)
| ~ ordinal(X18)
| ~ ordinal(X19) )
& ( ~ subset(X18,X19)
| ordinal_subset(X18,X19)
| ~ ordinal(X18)
| ~ ordinal(X19) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r1_ordinal1])])]) ).
cnf(c_0_18,negated_conjecture,
( ordinal_subset(X1,esk2_0)
| ordinal_subset(esk2_0,X1)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
ordinal(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
~ ordinal_subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_21,plain,
! [X44,X45,X46] :
( ~ in(X44,X45)
| ~ element(X45,powerset(X46))
| ~ empty(X46) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])]) ).
fof(c_0_22,plain,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ~ ( ~ in(X1,X2)
& X1 != X2
& ~ in(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[t24_ordinal1]) ).
cnf(c_0_23,plain,
( element(X1,X3)
| ~ in(X1,X2)
| ~ element(X2,powerset(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
( subset(X1,X2)
| ~ ordinal_subset(X1,X2)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,negated_conjecture,
ordinal_subset(esk2_0,esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_27,plain,
( ~ in(X1,X2)
| ~ element(X2,powerset(X3))
| ~ empty(X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_28,plain,
! [X10,X11] :
( ~ ordinal(X10)
| ~ ordinal(X11)
| in(X10,X11)
| X10 = X11
| in(X11,X10) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])]) ).
fof(c_0_29,plain,
! [X12,X13] :
( ~ element(X12,X13)
| empty(X13)
| in(X12,X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
cnf(c_0_30,plain,
( element(X1,X2)
| ~ subset(X3,X2)
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
subset(esk2_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_19]),c_0_14])]) ).
cnf(c_0_32,plain,
( ~ subset(X1,X2)
| ~ empty(X2)
| ~ in(X3,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_33,plain,
( in(X1,X2)
| X1 = X2
| in(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_34,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden]) ).
cnf(c_0_35,plain,
( empty(X2)
| in(X1,X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,negated_conjecture,
( element(X1,esk1_0)
| ~ in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,negated_conjecture,
( ~ empty(esk1_0)
| ~ in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_31]) ).
cnf(c_0_38,negated_conjecture,
( X1 = esk2_0
| in(X1,esk2_0)
| in(esk2_0,X1)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_14]) ).
cnf(c_0_39,negated_conjecture,
~ in(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_40,plain,
! [X6,X7] :
( ~ in(X6,X7)
| ~ in(X7,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])]) ).
cnf(c_0_41,negated_conjecture,
( in(X1,esk1_0)
| ~ in(X1,esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( esk2_0 = esk1_0
| in(esk1_0,esk2_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_19]),c_0_39]) ).
cnf(c_0_43,plain,
( ordinal_subset(X1,X2)
| ~ subset(X1,X2)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_44,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_45,negated_conjecture,
( esk2_0 = esk1_0
| in(esk1_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
fof(c_0_46,plain,
! [X35] : subset(X35,X35),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_47,negated_conjecture,
~ subset(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_43]),c_0_14]),c_0_19])]) ).
cnf(c_0_48,negated_conjecture,
esk2_0 = esk1_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_45]) ).
cnf(c_0_49,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48]),c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM394+1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n031.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 2400
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Oct 2 15:20:13 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order model finding
% 0.19/0.46 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.qlsgdbL09L/E---3.1_25855.p
% 0.19/0.49 # Version: 3.1pre001
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # new_bool_3 with pid 25993 completed with status 0
% 0.19/0.49 # Result found by new_bool_3
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FGHSS-FFSM11-SFFFFFNN
% 0.19/0.49 # partial match(1): FGHSS-FFMM11-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.49 # SAT001_MinMin_p005000_rr_RG with pid 26005 completed with status 0
% 0.19/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FGHSS-FFSM11-SFFFFFNN
% 0.19/0.49 # partial match(1): FGHSS-FFMM11-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Theorem
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 36
% 0.19/0.49 # Removed by relevancy pruning/SinE : 12
% 0.19/0.49 # Initial clauses : 36
% 0.19/0.49 # Removed in clause preprocessing : 0
% 0.19/0.49 # Initial clauses in saturation : 36
% 0.19/0.49 # Processed clauses : 123
% 0.19/0.49 # ...of these trivial : 0
% 0.19/0.49 # ...subsumed : 10
% 0.19/0.49 # ...remaining for further processing : 113
% 0.19/0.49 # Other redundant clauses eliminated : 0
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 1
% 0.19/0.49 # Backward-rewritten : 22
% 0.19/0.49 # Generated clauses : 83
% 0.19/0.49 # ...of the previous two non-redundant : 81
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 2
% 0.19/0.49 # Paramodulations : 83
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 0
% 0.19/0.49 # Total rewrite steps : 56
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 54
% 0.19/0.49 # Positive orientable unit clauses : 13
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 2
% 0.19/0.49 # Non-unit-clauses : 39
% 0.19/0.49 # Current number of unprocessed clauses: 19
% 0.19/0.49 # ...number of literals in the above : 51
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 59
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 213
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 175
% 0.19/0.49 # Non-unit clause-clause subsumptions : 12
% 0.19/0.49 # Unit Clause-clause subsumption calls : 81
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 2
% 0.19/0.49 # BW rewrite match successes : 2
% 0.19/0.49 # Condensation attempts : 0
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 2932
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.011 s
% 0.19/0.49 # System time : 0.002 s
% 0.19/0.49 # Total time : 0.012 s
% 0.19/0.49 # Maximum resident set size: 1872 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.013 s
% 0.19/0.49 # System time : 0.003 s
% 0.19/0.49 # Total time : 0.016 s
% 0.19/0.49 # Maximum resident set size: 1696 pages
% 0.19/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------