TSTP Solution File: SET907+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET907+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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:21:08 EDT 2024
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 8 unt; 0 def)
% Number of atoms : 42 ( 13 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 39 ( 16 ~; 12 |; 7 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t48_zfmisc_1,conjecture,
! [X1,X2,X3] :
( ( in(X1,X2)
& in(X3,X2) )
=> set_union2(unordered_pair(X1,X3),X2) = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.PsGfbzs2dY/E---3.1_17929.p',t48_zfmisc_1) ).
fof(t12_xboole_1,axiom,
! [X1,X2] :
( subset(X1,X2)
=> set_union2(X1,X2) = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.PsGfbzs2dY/E---3.1_17929.p',t12_xboole_1) ).
fof(t38_zfmisc_1,axiom,
! [X1,X2,X3] :
( subset(unordered_pair(X1,X2),X3)
<=> ( in(X1,X3)
& in(X2,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.PsGfbzs2dY/E---3.1_17929.p',t38_zfmisc_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.PsGfbzs2dY/E---3.1_17929.p',commutativity_k2_xboole_0) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( ( in(X1,X2)
& in(X3,X2) )
=> set_union2(unordered_pair(X1,X3),X2) = X2 ),
inference(assume_negation,[status(cth)],[t48_zfmisc_1]) ).
fof(c_0_5,plain,
! [X24,X25] :
( ~ subset(X24,X25)
| set_union2(X24,X25) = X25 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_xboole_1])])]) ).
fof(c_0_6,plain,
! [X16,X17,X18] :
( ( in(X16,X18)
| ~ subset(unordered_pair(X16,X17),X18) )
& ( in(X17,X18)
| ~ subset(unordered_pair(X16,X17),X18) )
& ( ~ in(X16,X18)
| ~ in(X17,X18)
| subset(unordered_pair(X16,X17),X18) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t38_zfmisc_1])])])]) ).
fof(c_0_7,negated_conjecture,
( in(esk1_0,esk2_0)
& in(esk3_0,esk2_0)
& set_union2(unordered_pair(esk1_0,esk3_0),esk2_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_8,plain,
! [X7,X8] : set_union2(X7,X8) = set_union2(X8,X7),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_9,plain,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( subset(unordered_pair(X1,X3),X2)
| ~ in(X1,X2)
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
set_union2(unordered_pair(esk1_0,esk3_0),esk2_0) != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( set_union2(unordered_pair(X1,X2),X3) = X3
| ~ in(X2,X3)
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
set_union2(esk2_0,unordered_pair(esk1_0,esk3_0)) != esk2_0,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( set_union2(X1,unordered_pair(X2,X3)) = X1
| ~ in(X3,X1)
| ~ in(X2,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
in(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
in(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET907+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n031.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 10:42:47 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.PsGfbzs2dY/E---3.1_17929.p
% 0.21/0.51 # Version: 3.1.0
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # new_bool_3 with pid 18069 completed with status 0
% 0.21/0.51 # Result found by new_bool_3
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51 # Search class: FHHSM-FFSS22-SFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.51 # SAT001_MinMin_p005000_rr_RG with pid 18074 completed with status 0
% 0.21/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51 # Search class: FHHSM-FFSS22-SFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 12
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 16
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 16
% 0.21/0.51 # Processed clauses : 61
% 0.21/0.51 # ...of these trivial : 2
% 0.21/0.51 # ...subsumed : 14
% 0.21/0.51 # ...remaining for further processing : 45
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 0
% 0.21/0.51 # Backward-rewritten : 1
% 0.21/0.51 # Generated clauses : 56
% 0.21/0.51 # ...of the previous two non-redundant : 39
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 56
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 10
% 0.21/0.51 # ...of those cached : 3
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 28
% 0.21/0.51 # Positive orientable unit clauses : 7
% 0.21/0.51 # Positive unorientable unit clauses: 2
% 0.21/0.51 # Negative unit clauses : 6
% 0.21/0.51 # Non-unit-clauses : 13
% 0.21/0.51 # Current number of unprocessed clauses: 10
% 0.21/0.51 # ...number of literals in the above : 30
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 17
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 41
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 41
% 0.21/0.51 # Non-unit clause-clause subsumptions : 10
% 0.21/0.51 # Unit Clause-clause subsumption calls : 2
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 19
% 0.21/0.51 # BW rewrite match successes : 16
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 1223
% 0.21/0.51 # Search garbage collected termcells : 131
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.007 s
% 0.21/0.51 # System time : 0.001 s
% 0.21/0.51 # Total time : 0.008 s
% 0.21/0.51 # Maximum resident set size: 1760 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.007 s
% 0.21/0.51 # System time : 0.004 s
% 0.21/0.51 # Total time : 0.011 s
% 0.21/0.51 # Maximum resident set size: 1692 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------