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