TSTP Solution File: SET874+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET874+1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 02:56:23 EDT 2024
% Result : Theorem 0.24s 0.50s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 10 unt; 0 def)
% Number of atoms : 45 ( 31 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 47 ( 19 ~; 20 |; 5 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 36 ( 2 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t14_zfmisc_1,conjecture,
! [X1,X2] : set_union2(singleton(X1),unordered_pair(X1,X2)) = unordered_pair(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t14_zfmisc_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(l23_zfmisc_1,axiom,
! [X1,X2] :
( in(X1,X2)
=> set_union2(singleton(X1),X2) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l23_zfmisc_1) ).
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] : set_union2(singleton(X1),unordered_pair(X1,X2)) = unordered_pair(X1,X2),
inference(assume_negation,[status(cth)],[t14_zfmisc_1]) ).
fof(c_0_5,negated_conjecture,
set_union2(singleton(esk1_0),unordered_pair(esk1_0,esk2_0)) != unordered_pair(esk1_0,esk2_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_6,plain,
! [X18,X19] : set_union2(X18,X19) = set_union2(X19,X18),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
fof(c_0_7,plain,
! [X25,X26] :
( ~ in(X25,X26)
| set_union2(singleton(X25),X26) = X26 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l23_zfmisc_1])])]) ).
fof(c_0_8,plain,
! [X9,X10,X11,X12,X13,X14,X15,X16] :
( ( ~ in(X12,X11)
| X12 = X9
| X12 = X10
| X11 != unordered_pair(X9,X10) )
& ( X13 != X9
| in(X13,X11)
| X11 != unordered_pair(X9,X10) )
& ( X13 != X10
| in(X13,X11)
| X11 != unordered_pair(X9,X10) )
& ( esk3_3(X14,X15,X16) != X14
| ~ in(esk3_3(X14,X15,X16),X16)
| X16 = unordered_pair(X14,X15) )
& ( esk3_3(X14,X15,X16) != X15
| ~ in(esk3_3(X14,X15,X16),X16)
| X16 = unordered_pair(X14,X15) )
& ( in(esk3_3(X14,X15,X16),X16)
| esk3_3(X14,X15,X16) = X14
| esk3_3(X14,X15,X16) = X15
| X16 = unordered_pair(X14,X15) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_tarski])])])])])])]) ).
cnf(c_0_9,negated_conjecture,
set_union2(singleton(esk1_0),unordered_pair(esk1_0,esk2_0)) != unordered_pair(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( set_union2(singleton(X1),X2) = X2
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( in(X1,X3)
| X1 != X2
| X3 != unordered_pair(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
set_union2(unordered_pair(esk1_0,esk2_0),singleton(esk1_0)) != unordered_pair(esk1_0,esk2_0),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( set_union2(X1,singleton(X2)) = X1
| ~ in(X2,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
in(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_12])]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SET874+1 : TPTP v8.2.0. Released v3.2.0.
% 0.14/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n018.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon May 20 13:23:08 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.24/0.48 Running first-order theorem proving
% 0.24/0.48 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.24/0.50 # Version: 3.1.0
% 0.24/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.24/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.24/0.50 # Starting sh5l with 300s (1) cores
% 0.24/0.50 # sh5l with pid 15036 completed with status 0
% 0.24/0.50 # Result found by sh5l
% 0.24/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.24/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.24/0.50 # Starting sh5l with 300s (1) cores
% 0.24/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.24/0.50 # Search class: FGHSS-FFSF32-SFFFFFNN
% 0.24/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.24/0.50 # SAT001_MinMin_p005000_rr_RG with pid 15038 completed with status 0
% 0.24/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.24/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.24/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.24/0.50 # Starting sh5l with 300s (1) cores
% 0.24/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.24/0.50 # Search class: FGHSS-FFSF32-SFFFFFNN
% 0.24/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.24/0.50 # Preprocessing time : 0.001 s
% 0.24/0.50 # Presaturation interreduction done
% 0.24/0.50
% 0.24/0.50 # Proof found!
% 0.24/0.50 # SZS status Theorem
% 0.24/0.50 # SZS output start CNFRefutation
% See solution above
% 0.24/0.50 # Parsed axioms : 11
% 0.24/0.50 # Removed by relevancy pruning/SinE : 0
% 0.24/0.50 # Initial clauses : 16
% 0.24/0.50 # Removed in clause preprocessing : 0
% 0.24/0.50 # Initial clauses in saturation : 16
% 0.24/0.50 # Processed clauses : 49
% 0.24/0.50 # ...of these trivial : 1
% 0.24/0.50 # ...subsumed : 8
% 0.24/0.50 # ...remaining for further processing : 40
% 0.24/0.50 # Other redundant clauses eliminated : 5
% 0.24/0.50 # Clauses deleted for lack of memory : 0
% 0.24/0.50 # Backward-subsumed : 0
% 0.24/0.50 # Backward-rewritten : 1
% 0.24/0.50 # Generated clauses : 37
% 0.24/0.50 # ...of the previous two non-redundant : 24
% 0.24/0.50 # ...aggressively subsumed : 0
% 0.24/0.50 # Contextual simplify-reflections : 0
% 0.24/0.50 # Paramodulations : 34
% 0.24/0.50 # Factorizations : 0
% 0.24/0.50 # NegExts : 0
% 0.24/0.50 # Equation resolutions : 5
% 0.24/0.50 # Disequality decompositions : 0
% 0.24/0.50 # Total rewrite steps : 7
% 0.24/0.50 # ...of those cached : 1
% 0.24/0.50 # Propositional unsat checks : 0
% 0.24/0.50 # Propositional check models : 0
% 0.24/0.50 # Propositional check unsatisfiable : 0
% 0.24/0.50 # Propositional clauses : 0
% 0.24/0.50 # Propositional clauses after purity: 0
% 0.24/0.50 # Propositional unsat core size : 0
% 0.24/0.50 # Propositional preprocessing time : 0.000
% 0.24/0.50 # Propositional encoding time : 0.000
% 0.24/0.50 # Propositional solver time : 0.000
% 0.24/0.50 # Success case prop preproc time : 0.000
% 0.24/0.50 # Success case prop encoding time : 0.000
% 0.24/0.50 # Success case prop solver time : 0.000
% 0.24/0.50 # Current number of processed clauses : 20
% 0.24/0.50 # Positive orientable unit clauses : 4
% 0.24/0.50 # Positive unorientable unit clauses: 2
% 0.24/0.50 # Negative unit clauses : 4
% 0.24/0.50 # Non-unit-clauses : 10
% 0.24/0.50 # Current number of unprocessed clauses: 6
% 0.24/0.50 # ...number of literals in the above : 17
% 0.24/0.50 # Current number of archived formulas : 0
% 0.24/0.50 # Current number of archived clauses : 17
% 0.24/0.50 # Clause-clause subsumption calls (NU) : 22
% 0.24/0.50 # Rec. Clause-clause subsumption calls : 21
% 0.24/0.50 # Non-unit clause-clause subsumptions : 4
% 0.24/0.50 # Unit Clause-clause subsumption calls : 1
% 0.24/0.50 # Rewrite failures with RHS unbound : 0
% 0.24/0.50 # BW rewrite match attempts : 15
% 0.24/0.50 # BW rewrite match successes : 12
% 0.24/0.50 # Condensation attempts : 0
% 0.24/0.50 # Condensation successes : 0
% 0.24/0.50 # Termbank termtop insertions : 1149
% 0.24/0.50 # Search garbage collected termcells : 221
% 0.24/0.50
% 0.24/0.50 # -------------------------------------------------
% 0.24/0.50 # User time : 0.004 s
% 0.24/0.50 # System time : 0.001 s
% 0.24/0.50 # Total time : 0.005 s
% 0.24/0.50 # Maximum resident set size: 1700 pages
% 0.24/0.50
% 0.24/0.50 # -------------------------------------------------
% 0.24/0.50 # User time : 0.005 s
% 0.24/0.50 # System time : 0.003 s
% 0.24/0.50 # Total time : 0.008 s
% 0.24/0.50 # Maximum resident set size: 1696 pages
% 0.24/0.50 % E---3.1 exiting
% 0.24/0.50 % E exiting
%------------------------------------------------------------------------------