TSTP Solution File: SET912+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET912+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:21:16 EDT 2023
% Result : Theorem 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 9 unt; 0 def)
% Number of atoms : 39 ( 11 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 33 ( 13 ~; 9 |; 7 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 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 : 28 ( 0 sgn; 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t53_zfmisc_1,conjecture,
! [X1,X2,X3] :
( ( in(X1,X2)
& in(X3,X2) )
=> set_intersection2(unordered_pair(X1,X3),X2) = unordered_pair(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.B1lgrz3udX/E---3.1_6044.p',t53_zfmisc_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.B1lgrz3udX/E---3.1_6044.p',t38_zfmisc_1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.B1lgrz3udX/E---3.1_6044.p',commutativity_k3_xboole_0) ).
fof(t28_xboole_1,axiom,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.B1lgrz3udX/E---3.1_6044.p',t28_xboole_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( ( in(X1,X2)
& in(X3,X2) )
=> set_intersection2(unordered_pair(X1,X3),X2) = unordered_pair(X1,X3) ),
inference(assume_negation,[status(cth)],[t53_zfmisc_1]) ).
fof(c_0_5,plain,
! [X9,X10,X11] :
( ( in(X9,X11)
| ~ subset(unordered_pair(X9,X10),X11) )
& ( in(X10,X11)
| ~ subset(unordered_pair(X9,X10),X11) )
& ( ~ in(X9,X11)
| ~ in(X10,X11)
| subset(unordered_pair(X9,X10),X11) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t38_zfmisc_1])])]) ).
fof(c_0_6,negated_conjecture,
( in(esk1_0,esk2_0)
& in(esk3_0,esk2_0)
& set_intersection2(unordered_pair(esk1_0,esk3_0),esk2_0) != unordered_pair(esk1_0,esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_7,plain,
( subset(unordered_pair(X1,X3),X2)
| ~ in(X1,X2)
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
in(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X12,X13] : set_intersection2(X12,X13) = set_intersection2(X13,X12),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(c_0_10,plain,
! [X15,X16] :
( ~ subset(X15,X16)
| set_intersection2(X15,X16) = X15 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t28_xboole_1])]) ).
cnf(c_0_11,negated_conjecture,
( subset(unordered_pair(X1,esk3_0),esk2_0)
| ~ in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
in(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
set_intersection2(unordered_pair(esk1_0,esk3_0),esk2_0) != unordered_pair(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
subset(unordered_pair(esk1_0,esk3_0),esk2_0),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
set_intersection2(esk2_0,unordered_pair(esk1_0,esk3_0)) != unordered_pair(esk1_0,esk3_0),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_14]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SET912+1 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.10 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n024.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 16:47:57 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.B1lgrz3udX/E---3.1_6044.p
% 0.15/0.42 # Version: 3.1pre001
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # sh5l with pid 6125 completed with status 0
% 0.15/0.42 # Result found by sh5l
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.42 # Search class: FHHSM-FFSF22-SFFFFFNN
% 0.15/0.42 # partial match(1): FHUSM-FFSF22-SFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 0.15/0.42 # G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with pid 6128 completed with status 0
% 0.15/0.42 # Result found by G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.42 # Search class: FHHSM-FFSF22-SFFFFFNN
% 0.15/0.42 # partial match(1): FHUSM-FFSF22-SFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 0.15/0.42 # Preprocessing time : 0.001 s
% 0.15/0.42 # Presaturation interreduction done
% 0.15/0.42
% 0.15/0.42 # Proof found!
% 0.15/0.42 # SZS status Theorem
% 0.15/0.42 # SZS output start CNFRefutation
% See solution above
% 0.15/0.42 # Parsed axioms : 10
% 0.15/0.42 # Removed by relevancy pruning/SinE : 2
% 0.15/0.42 # Initial clauses : 12
% 0.15/0.42 # Removed in clause preprocessing : 0
% 0.15/0.42 # Initial clauses in saturation : 12
% 0.15/0.42 # Processed clauses : 44
% 0.15/0.42 # ...of these trivial : 2
% 0.15/0.42 # ...subsumed : 8
% 0.15/0.42 # ...remaining for further processing : 34
% 0.15/0.42 # Other redundant clauses eliminated : 0
% 0.15/0.42 # Clauses deleted for lack of memory : 0
% 0.15/0.42 # Backward-subsumed : 0
% 0.15/0.42 # Backward-rewritten : 1
% 0.15/0.42 # Generated clauses : 35
% 0.15/0.42 # ...of the previous two non-redundant : 24
% 0.15/0.42 # ...aggressively subsumed : 0
% 0.15/0.42 # Contextual simplify-reflections : 0
% 0.15/0.42 # Paramodulations : 35
% 0.15/0.42 # Factorizations : 0
% 0.15/0.42 # NegExts : 0
% 0.15/0.42 # Equation resolutions : 0
% 0.15/0.42 # Total rewrite steps : 13
% 0.15/0.42 # Propositional unsat checks : 0
% 0.15/0.42 # Propositional check models : 0
% 0.15/0.42 # Propositional check unsatisfiable : 0
% 0.15/0.42 # Propositional clauses : 0
% 0.15/0.42 # Propositional clauses after purity: 0
% 0.15/0.42 # Propositional unsat core size : 0
% 0.15/0.42 # Propositional preprocessing time : 0.000
% 0.15/0.42 # Propositional encoding time : 0.000
% 0.15/0.42 # Propositional solver time : 0.000
% 0.15/0.42 # Success case prop preproc time : 0.000
% 0.15/0.42 # Success case prop encoding time : 0.000
% 0.15/0.42 # Success case prop solver time : 0.000
% 0.15/0.42 # Current number of processed clauses : 21
% 0.15/0.42 # Positive orientable unit clauses : 8
% 0.15/0.42 # Positive unorientable unit clauses: 2
% 0.15/0.42 # Negative unit clauses : 5
% 0.15/0.42 # Non-unit-clauses : 6
% 0.15/0.42 # Current number of unprocessed clauses: 4
% 0.15/0.42 # ...number of literals in the above : 7
% 0.15/0.42 # Current number of archived formulas : 0
% 0.15/0.42 # Current number of archived clauses : 13
% 0.15/0.42 # Clause-clause subsumption calls (NU) : 14
% 0.15/0.42 # Rec. Clause-clause subsumption calls : 14
% 0.15/0.42 # Non-unit clause-clause subsumptions : 4
% 0.15/0.42 # Unit Clause-clause subsumption calls : 1
% 0.15/0.42 # Rewrite failures with RHS unbound : 0
% 0.15/0.42 # BW rewrite match attempts : 13
% 0.15/0.42 # BW rewrite match successes : 12
% 0.15/0.42 # Condensation attempts : 0
% 0.15/0.42 # Condensation successes : 0
% 0.15/0.42 # Termbank termtop insertions : 773
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.003 s
% 0.15/0.42 # System time : 0.002 s
% 0.15/0.42 # Total time : 0.005 s
% 0.15/0.42 # Maximum resident set size: 1780 pages
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.004 s
% 0.15/0.42 # System time : 0.003 s
% 0.15/0.42 # Total time : 0.008 s
% 0.15/0.42 # Maximum resident set size: 1676 pages
% 0.15/0.42 % E---3.1 exiting
% 0.15/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------