TSTP Solution File: SET017+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET017+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:17:56 EDT 2023
% Result : Theorem 0.15s 0.41s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 8 unt; 0 def)
% Number of atoms : 45 ( 20 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 42 ( 14 ~; 14 |; 11 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 21 ( 2 sgn; 12 !; 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.yihW7NvYnd/E---3.1_29826.p',unordered_pair_defn) ).
fof(left_cancellation,conjecture,
! [X1,X2,X5] :
( ( member(X2,universal_class)
& member(X5,universal_class)
& unordered_pair(X1,X2) = unordered_pair(X1,X5) )
=> X2 = X5 ),
file('/export/starexec/sandbox2/tmp/tmp.yihW7NvYnd/E---3.1_29826.p',left_cancellation) ).
fof(c_0_2,plain,
! [X13,X14,X15] :
( ( member(X13,universal_class)
| ~ member(X13,unordered_pair(X14,X15)) )
& ( X13 = X14
| X13 = X15
| ~ member(X13,unordered_pair(X14,X15)) )
& ( X13 != X14
| ~ member(X13,universal_class)
| member(X13,unordered_pair(X14,X15)) )
& ( X13 != X15
| ~ member(X13,universal_class)
| member(X13,unordered_pair(X14,X15)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair_defn])])]) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X5] :
( ( member(X2,universal_class)
& member(X5,universal_class)
& unordered_pair(X1,X2) = unordered_pair(X1,X5) )
=> X2 = X5 ),
inference(assume_negation,[status(cth)],[left_cancellation]) ).
cnf(c_0_4,plain,
( member(X1,unordered_pair(X3,X2))
| X1 != X2
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
fof(c_0_5,negated_conjecture,
( member(esk2_0,universal_class)
& member(esk3_0,universal_class)
& unordered_pair(esk1_0,esk2_0) = unordered_pair(esk1_0,esk3_0)
& esk2_0 != esk3_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,plain,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
inference(er,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
unordered_pair(esk1_0,esk2_0) = unordered_pair(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
member(esk3_0,universal_class),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
member(esk3_0,unordered_pair(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).
cnf(c_0_11,negated_conjecture,
esk2_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
esk1_0 = esk3_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_13,negated_conjecture,
unordered_pair(esk3_0,esk3_0) = unordered_pair(esk3_0,esk2_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_12]),c_0_12]) ).
cnf(c_0_14,negated_conjecture,
( X1 = esk3_0
| ~ member(X1,unordered_pair(esk3_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_9,c_0_13]) ).
cnf(c_0_15,negated_conjecture,
member(esk2_0,universal_class),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_6]),c_0_15])]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SET017+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n023.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 17:33:37 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 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.yihW7NvYnd/E---3.1_29826.p
% 0.15/0.41 # Version: 3.1pre001
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 # Starting sh5l with 300s (1) cores
% 0.15/0.41 # new_bool_3 with pid 29907 completed with status 0
% 0.15/0.41 # Result found by new_bool_3
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 # Search class: FGUSS-FFSS21-MFFFFFNN
% 0.15/0.41 # partial match(1): FGUSS-FFSS21-SFFFFFNN
% 0.15/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.41 # SAT001_MinMin_p005000_rr_RG with pid 29910 completed with status 0
% 0.15/0.41 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 # Search class: FGUSS-FFSS21-MFFFFFNN
% 0.15/0.41 # partial match(1): FGUSS-FFSS21-SFFFFFNN
% 0.15/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.41 # Preprocessing time : 0.001 s
% 0.15/0.41 # Presaturation interreduction done
% 0.15/0.41
% 0.15/0.41 # Proof found!
% 0.15/0.41 # SZS status Theorem
% 0.15/0.41 # SZS output start CNFRefutation
% See solution above
% 0.15/0.41 # Parsed axioms : 44
% 0.15/0.41 # Removed by relevancy pruning/SinE : 38
% 0.15/0.41 # Initial clauses : 14
% 0.15/0.41 # Removed in clause preprocessing : 0
% 0.15/0.41 # Initial clauses in saturation : 14
% 0.15/0.41 # Processed clauses : 38
% 0.15/0.41 # ...of these trivial : 2
% 0.15/0.41 # ...subsumed : 2
% 0.15/0.41 # ...remaining for further processing : 34
% 0.15/0.41 # Other redundant clauses eliminated : 2
% 0.15/0.41 # Clauses deleted for lack of memory : 0
% 0.15/0.41 # Backward-subsumed : 0
% 0.15/0.41 # Backward-rewritten : 1
% 0.15/0.41 # Generated clauses : 32
% 0.15/0.41 # ...of the previous two non-redundant : 26
% 0.15/0.41 # ...aggressively subsumed : 0
% 0.15/0.41 # Contextual simplify-reflections : 0
% 0.15/0.41 # Paramodulations : 30
% 0.15/0.41 # Factorizations : 0
% 0.15/0.41 # NegExts : 0
% 0.15/0.41 # Equation resolutions : 2
% 0.15/0.41 # Total rewrite steps : 13
% 0.15/0.41 # Propositional unsat checks : 0
% 0.15/0.41 # Propositional check models : 0
% 0.15/0.41 # Propositional check unsatisfiable : 0
% 0.15/0.41 # Propositional clauses : 0
% 0.15/0.41 # Propositional clauses after purity: 0
% 0.15/0.41 # Propositional unsat core size : 0
% 0.15/0.41 # Propositional preprocessing time : 0.000
% 0.15/0.41 # Propositional encoding time : 0.000
% 0.15/0.41 # Propositional solver time : 0.000
% 0.15/0.41 # Success case prop preproc time : 0.000
% 0.15/0.41 # Success case prop encoding time : 0.000
% 0.15/0.41 # Success case prop solver time : 0.000
% 0.15/0.41 # Current number of processed clauses : 17
% 0.15/0.41 # Positive orientable unit clauses : 8
% 0.15/0.41 # Positive unorientable unit clauses: 1
% 0.15/0.41 # Negative unit clauses : 1
% 0.15/0.41 # Non-unit-clauses : 7
% 0.15/0.41 # Current number of unprocessed clauses: 16
% 0.15/0.41 # ...number of literals in the above : 29
% 0.15/0.41 # Current number of archived formulas : 0
% 0.15/0.41 # Current number of archived clauses : 15
% 0.15/0.41 # Clause-clause subsumption calls (NU) : 12
% 0.15/0.41 # Rec. Clause-clause subsumption calls : 12
% 0.15/0.41 # Non-unit clause-clause subsumptions : 2
% 0.15/0.41 # Unit Clause-clause subsumption calls : 1
% 0.15/0.41 # Rewrite failures with RHS unbound : 0
% 0.15/0.41 # BW rewrite match attempts : 12
% 0.15/0.41 # BW rewrite match successes : 2
% 0.15/0.41 # Condensation attempts : 0
% 0.15/0.41 # Condensation successes : 0
% 0.15/0.41 # Termbank termtop insertions : 1376
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.003 s
% 0.15/0.41 # System time : 0.002 s
% 0.15/0.41 # Total time : 0.005 s
% 0.15/0.41 # Maximum resident set size: 1888 pages
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.005 s
% 0.15/0.41 # System time : 0.004 s
% 0.15/0.41 # Total time : 0.009 s
% 0.15/0.41 # Maximum resident set size: 1728 pages
% 0.15/0.41 % E---3.1 exiting
% 0.15/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------