TSTP Solution File: SET101+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET101+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:18:30 EDT 2023
% Result : Theorem 0.13s 0.40s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 16 unt; 0 def)
% Number of atoms : 36 ( 13 equ)
% Maximal formula atoms : 11 ( 1 avg)
% Number of connectives : 28 ( 12 ~; 11 |; 4 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 33 ( 6 sgn; 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(unordered_pair_defn,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( member(X3,universal_class)
& ( X3 = X1
| X3 = X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.7f5yfmIYjL/E---3.1_705.p',unordered_pair_defn) ).
fof(unordered_pair,axiom,
! [X1,X2] : member(unordered_pair(X1,X2),universal_class),
file('/export/starexec/sandbox2/tmp/tmp.7f5yfmIYjL/E---3.1_705.p',unordered_pair) ).
fof(singleton_set_defn,axiom,
! [X1] : singleton(X1) = unordered_pair(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.7f5yfmIYjL/E---3.1_705.p',singleton_set_defn) ).
fof(singleton_member_of_ordered_pair,conjecture,
! [X1,X2] : member(singleton(X1),ordered_pair(X1,X2)),
file('/export/starexec/sandbox2/tmp/tmp.7f5yfmIYjL/E---3.1_705.p',singleton_member_of_ordered_pair) ).
fof(ordered_pair_defn,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))),
file('/export/starexec/sandbox2/tmp/tmp.7f5yfmIYjL/E---3.1_705.p',ordered_pair_defn) ).
fof(c_0_5,plain,
! [X45,X46,X47] :
( ( member(X45,universal_class)
| ~ member(X45,unordered_pair(X46,X47)) )
& ( X45 = X46
| X45 = X47
| ~ member(X45,unordered_pair(X46,X47)) )
& ( X45 != X46
| ~ member(X45,universal_class)
| member(X45,unordered_pair(X46,X47)) )
& ( X45 != X47
| ~ member(X45,universal_class)
| member(X45,unordered_pair(X46,X47)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair_defn])])]) ).
fof(c_0_6,plain,
! [X48,X49] : member(unordered_pair(X48,X49),universal_class),
inference(variable_rename,[status(thm)],[unordered_pair]) ).
fof(c_0_7,plain,
! [X32] : singleton(X32) = unordered_pair(X32,X32),
inference(variable_rename,[status(thm)],[singleton_set_defn]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2] : member(singleton(X1),ordered_pair(X1,X2)),
inference(assume_negation,[status(cth)],[singleton_member_of_ordered_pair]) ).
cnf(c_0_9,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X2
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_10,plain,
! [X22,X23] : ordered_pair(X22,X23) = unordered_pair(singleton(X22),unordered_pair(X22,singleton(X23))),
inference(variable_rename,[status(thm)],[ordered_pair_defn]) ).
cnf(c_0_11,plain,
member(unordered_pair(X1,X2),universal_class),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_13,negated_conjecture,
~ member(singleton(esk1_0),ordered_pair(esk1_0,esk2_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_14,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
ordered_pair(X1,X2) = unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
member(singleton(X1),universal_class),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
~ member(singleton(esk1_0),ordered_pair(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
member(singleton(X1),ordered_pair(X1,X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.09 % Problem : SET101+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.07/0.09 % Command : run_E %s %d THM
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 2400
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Mon Oct 2 17:52:34 EDT 2023
% 0.09/0.28 % CPUTime :
% 0.13/0.38 Running first-order theorem proving
% 0.13/0.38 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.7f5yfmIYjL/E---3.1_705.p
% 0.13/0.40 # Version: 3.1pre001
% 0.13/0.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.40 # Starting sh5l with 300s (1) cores
% 0.13/0.40 # sh5l with pid 886 completed with status 0
% 0.13/0.40 # Result found by sh5l
% 0.13/0.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.40 # Starting sh5l with 300s (1) cores
% 0.13/0.40 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.40 # Search class: FGHSM-FFMS31-MFFFFFNN
% 0.13/0.40 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.40 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 130s (1) cores
% 0.13/0.40 # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 907 completed with status 0
% 0.13/0.40 # Result found by G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 0.13/0.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.40 # Starting sh5l with 300s (1) cores
% 0.13/0.40 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.40 # Search class: FGHSM-FFMS31-MFFFFFNN
% 0.13/0.40 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.40 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 130s (1) cores
% 0.13/0.40 # Preprocessing time : 0.001 s
% 0.13/0.40
% 0.13/0.40 # Proof found!
% 0.13/0.40 # SZS status Theorem
% 0.13/0.40 # SZS output start CNFRefutation
% See solution above
% 0.13/0.40 # Parsed axioms : 44
% 0.13/0.40 # Removed by relevancy pruning/SinE : 9
% 0.13/0.40 # Initial clauses : 72
% 0.13/0.40 # Removed in clause preprocessing : 0
% 0.13/0.40 # Initial clauses in saturation : 72
% 0.13/0.40 # Processed clauses : 85
% 0.13/0.40 # ...of these trivial : 2
% 0.13/0.40 # ...subsumed : 2
% 0.13/0.40 # ...remaining for further processing : 81
% 0.13/0.40 # Other redundant clauses eliminated : 5
% 0.13/0.40 # Clauses deleted for lack of memory : 0
% 0.13/0.40 # Backward-subsumed : 2
% 0.13/0.40 # Backward-rewritten : 1
% 0.13/0.40 # Generated clauses : 178
% 0.13/0.40 # ...of the previous two non-redundant : 155
% 0.13/0.40 # ...aggressively subsumed : 0
% 0.13/0.40 # Contextual simplify-reflections : 0
% 0.13/0.40 # Paramodulations : 171
% 0.13/0.40 # Factorizations : 0
% 0.13/0.40 # NegExts : 0
% 0.13/0.40 # Equation resolutions : 7
% 0.13/0.40 # Total rewrite steps : 11
% 0.13/0.40 # Propositional unsat checks : 0
% 0.13/0.40 # Propositional check models : 0
% 0.13/0.40 # Propositional check unsatisfiable : 0
% 0.13/0.40 # Propositional clauses : 0
% 0.13/0.40 # Propositional clauses after purity: 0
% 0.13/0.40 # Propositional unsat core size : 0
% 0.13/0.40 # Propositional preprocessing time : 0.000
% 0.13/0.40 # Propositional encoding time : 0.000
% 0.13/0.40 # Propositional solver time : 0.000
% 0.13/0.40 # Success case prop preproc time : 0.000
% 0.13/0.40 # Success case prop encoding time : 0.000
% 0.13/0.40 # Success case prop solver time : 0.000
% 0.13/0.40 # Current number of processed clauses : 74
% 0.13/0.40 # Positive orientable unit clauses : 19
% 0.13/0.40 # Positive unorientable unit clauses: 0
% 0.13/0.40 # Negative unit clauses : 2
% 0.13/0.40 # Non-unit-clauses : 53
% 0.13/0.40 # Current number of unprocessed clauses: 141
% 0.13/0.40 # ...number of literals in the above : 341
% 0.13/0.40 # Current number of archived formulas : 0
% 0.13/0.40 # Current number of archived clauses : 3
% 0.13/0.40 # Clause-clause subsumption calls (NU) : 381
% 0.13/0.40 # Rec. Clause-clause subsumption calls : 336
% 0.13/0.40 # Non-unit clause-clause subsumptions : 4
% 0.13/0.40 # Unit Clause-clause subsumption calls : 28
% 0.13/0.40 # Rewrite failures with RHS unbound : 0
% 0.13/0.40 # BW rewrite match attempts : 12
% 0.13/0.40 # BW rewrite match successes : 1
% 0.13/0.40 # Condensation attempts : 0
% 0.13/0.40 # Condensation successes : 0
% 0.13/0.40 # Termbank termtop insertions : 5531
% 0.13/0.40
% 0.13/0.40 # -------------------------------------------------
% 0.13/0.40 # User time : 0.007 s
% 0.13/0.40 # System time : 0.002 s
% 0.13/0.40 # Total time : 0.009 s
% 0.13/0.40 # Maximum resident set size: 1916 pages
% 0.13/0.40
% 0.13/0.40 # -------------------------------------------------
% 0.13/0.40 # User time : 0.009 s
% 0.13/0.40 # System time : 0.003 s
% 0.13/0.40 # Total time : 0.012 s
% 0.13/0.40 # Maximum resident set size: 1728 pages
% 0.13/0.40 % E---3.1 exiting
% 0.13/0.40 % E---3.1 exiting
%------------------------------------------------------------------------------