TSTP Solution File: SEU150+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU150+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:24:57 EDT 2023
% Result : Timeout 0.35s 300.09s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 8 unt; 0 def)
% Number of atoms : 26 ( 25 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 17 ( 8 ~; 5 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 4 sgn; 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t9_zfmisc_1,conjecture,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X2 = X3 ),
file('/export/starexec/sandbox2/tmp/tmp.cGNiLmBe1g/E---3.1_1299.p',t9_zfmisc_1) ).
fof(t8_zfmisc_1,axiom,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X1 = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.cGNiLmBe1g/E---3.1_1299.p',t8_zfmisc_1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.cGNiLmBe1g/E---3.1_1299.p',commutativity_k2_tarski) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X2 = X3 ),
inference(assume_negation,[status(cth)],[t9_zfmisc_1]) ).
fof(c_0_4,plain,
! [X9,X10,X11] :
( singleton(X9) != unordered_pair(X10,X11)
| X9 = X10 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_zfmisc_1])]) ).
fof(c_0_5,negated_conjecture,
( singleton(esk1_0) = unordered_pair(esk2_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,
( X1 = X2
| singleton(X1) != unordered_pair(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
singleton(esk1_0) = unordered_pair(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X7,X8] : unordered_pair(X7,X8) = unordered_pair(X8,X7),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_9,negated_conjecture,
( esk1_0 = X1
| unordered_pair(esk2_0,esk3_0) != unordered_pair(X1,X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
esk1_0 = esk2_0,
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( X1 = X2
| singleton(X1) != unordered_pair(X3,X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
singleton(esk2_0) = unordered_pair(esk2_0,esk3_0),
inference(rw,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
( esk2_0 = X1
| unordered_pair(esk2_0,esk3_0) != unordered_pair(X2,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,negated_conjecture,
esk2_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU150+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n012.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 08:34:06 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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.cGNiLmBe1g/E---3.1_1299.p
% 0.35/300.09 # Version: 3.1pre001
% 0.35/300.09 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.35/300.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/300.09 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.35/300.09 # Starting new_bool_3 with 300s (1) cores
% 0.35/300.09 # Starting new_bool_1 with 300s (1) cores
% 0.35/300.09 # Starting sh5l with 300s (1) cores
% 0.35/300.09 # new_bool_3 with pid 1506 completed with status 0
% 0.35/300.09 # Result found by new_bool_3
% 0.35/300.09 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.35/300.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/300.09 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.35/300.09 # Starting new_bool_3 with 300s (1) cores
% 0.35/300.09 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.35/300.09 # Search class: FHUPF-FFSF21-SFFFFFNN
% 0.35/300.09 # partial match(1): FHUSF-FFSF21-SFFFFFNN
% 0.35/300.09 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.35/300.09 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.35/300.09 # SAT001_MinMin_p005000_rr_RG with pid 1511 completed with status 0
% 0.35/300.09 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.35/300.09 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.35/300.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/300.09 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.35/300.09 # Starting new_bool_3 with 300s (1) cores
% 0.35/300.09 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.35/300.09 # Search class: FHUPF-FFSF21-SFFFFFNN
% 0.35/300.09 # partial match(1): FHUSF-FFSF21-SFFFFFNN
% 0.35/300.09 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.35/300.09 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.35/300.09 # Preprocessing time : 0.001 s
% 0.35/300.09 # Presaturation interreduction done
% 0.35/300.09
% 0.35/300.09 # Proof found!
% 0.35/300.09 # SZS status Theorem
% 0.35/300.09 # SZS output start CNFRefutation
% See solution above
% 0.35/300.09 # Parsed axioms : 5
% 0.35/300.09 # Removed by relevancy pruning/SinE : 2
% 0.35/300.09 # Initial clauses : 4
% 0.35/300.09 # Removed in clause preprocessing : 0
% 0.35/300.09 # Initial clauses in saturation : 4
% 0.35/300.09 # Processed clauses : 18
% 0.35/300.09 # ...of these trivial : 0
% 0.35/300.09 # ...subsumed : 4
% 0.35/300.09 # ...remaining for further processing : 14
% 0.35/300.09 # Other redundant clauses eliminated : 0
% 0.35/300.09 # Clauses deleted for lack of memory : 0
% 0.35/300.09 # Backward-subsumed : 0
% 0.35/300.09 # Backward-rewritten : 2
% 0.35/300.09 # Generated clauses : 17
% 0.35/300.09 # ...of the previous two non-redundant : 15
% 0.35/300.09 # ...aggressively subsumed : 0
% 0.35/300.09 # Contextual simplify-reflections : 0
% 0.35/300.09 # Paramodulations : 14
% 0.35/300.09 # Factorizations : 0
% 0.35/300.09 # NegExts : 0
% 0.35/300.09 # Equation resolutions : 3
% 0.35/300.09 # Total rewrite steps : 2
% 0.35/300.09 # Propositional unsat checks : 0
% 0.35/300.09 # Propositional check models : 0
% 0.35/300.09 # Propositional check unsatisfiable : 0
% 0.35/300.09 # Propositional clauses : 0
% 0.35/300.09 # Propositional clauses after purity: 0
% 0.35/300.09 # Propositional unsat core size : 0
% 0.35/300.09 # Propositional preprocessing time : 0.000
% 0.35/300.09 # Propositional encoding time : 0.000
% 0.35/300.09 # Propositional solver time : 0.000
% 0.35/300.09 # Success case prop preproc time : 0.000
% 0.35/300.09 # Success case prop encoding time : 0.000
% 0.35/300.09 # Success case prop solver time : 0.000
% 0.35/300.09 # Current number of processed clauses : 8
% 0.35/300.09 # Positive orientable unit clauses : 2
% 0.35/300.09 # Positive unorientable unit clauses: 1
% 0.35/300.09 # Negative unit clauses : 1
% 0.35/300.09 # Non-unit-clauses : 4
% 0.35/300.09 # Current number of unprocessed clauses: 2
% 0.35/300.09 # ...number of literals in the above : 4
% 0.35/300.09 # Current number of archived formulas : 0
% 0.35/300.09 # Current number of archived clauses : 6
% 0.35/300.09 # Clause-clause subsumption calls (NU) : 10
% 0.35/300.09 # Rec. Clause-clause subsumption calls : 10
% 0.35/300.09 # Non-unit clause-clause subsumptions : 4
% 0.35/300.09 # Unit Clause-clause subsumption calls : 0
% 0.35/300.09 # Rewrite failures with RHS unbound : 0
% 0.35/300.09 # BW rewrite match attempts : 7
% 0.35/300.09 # BW rewrite match successes : 7
% 0.35/300.09 # Condensation attempts : 0
% 0.35/300.09 # Condensation successes : 0
% 0.35/300.09 # Termbank termtop insertions : 258
% 0.35/300.09
% 0.35/300.09 # -------------------------------------------------
% 0.35/300.09 # User time : 0.003 s
% 0.35/300.09 # System time : 0.002 s
% 0.35/300.09 # Total time : 0.005 s
% 0.35/300.09 # Maximum resident set size: 1784 pages
% 0.35/300.09
% 0.35/300.09 # -------------------------------------------------
% 0.35/300.09 # User time : 0.004 s
% 0.35/300.09 # System time : 0.005 s
% 0.35/300.09 # Total time : 0.008 s
% 0.35/300.09 # Maximum resident set size: 1668 pages
% 0.35/300.09 % E---3.1 exiting
% 0.35/300.10 % E---3.1 exiting
%------------------------------------------------------------------------------