TSTP Solution File: SET877+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET877+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:17 EDT 2023
% Result : Theorem 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 7 unt; 0 def)
% Number of atoms : 41 ( 28 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 38 ( 15 ~; 14 |; 4 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn; 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l30_zfmisc_1,axiom,
! [X1,X2] :
( set_intersection2(X1,singleton(X2)) = singleton(X2)
=> in(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.R0yMcJnNXi/E---3.1_18226.p',l30_zfmisc_1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.R0yMcJnNXi/E---3.1_18226.p',commutativity_k3_xboole_0) ).
fof(t18_zfmisc_1,conjecture,
! [X1,X2] :
( set_intersection2(singleton(X1),singleton(X2)) = singleton(X1)
=> X1 = X2 ),
file('/export/starexec/sandbox/tmp/tmp.R0yMcJnNXi/E---3.1_18226.p',t18_zfmisc_1) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.R0yMcJnNXi/E---3.1_18226.p',d1_tarski) ).
fof(c_0_4,plain,
! [X13,X14] :
( set_intersection2(X13,singleton(X14)) != singleton(X14)
| in(X14,X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l30_zfmisc_1])]) ).
fof(c_0_5,plain,
! [X15,X16] : set_intersection2(X15,X16) = set_intersection2(X16,X15),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] :
( set_intersection2(singleton(X1),singleton(X2)) = singleton(X1)
=> X1 = X2 ),
inference(assume_negation,[status(cth)],[t18_zfmisc_1]) ).
fof(c_0_7,plain,
! [X6,X7,X8,X9,X10,X11] :
( ( ~ in(X8,X7)
| X8 = X6
| X7 != singleton(X6) )
& ( X9 != X6
| in(X9,X7)
| X7 != singleton(X6) )
& ( ~ in(esk3_2(X10,X11),X11)
| esk3_2(X10,X11) != X10
| X11 = singleton(X10) )
& ( in(esk3_2(X10,X11),X11)
| esk3_2(X10,X11) = X10
| X11 = singleton(X10) ) ),
inference(distribute,[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)],[d1_tarski])])])])])]) ).
cnf(c_0_8,plain,
( in(X2,X1)
| set_intersection2(X1,singleton(X2)) != singleton(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_10,negated_conjecture,
( set_intersection2(singleton(esk1_0),singleton(esk2_0)) = singleton(esk1_0)
& esk1_0 != esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_11,plain,
( X1 = X3
| ~ in(X1,X2)
| X2 != singleton(X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( in(X1,X2)
| set_intersection2(singleton(X1),X2) != singleton(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
set_intersection2(singleton(esk1_0),singleton(esk2_0)) = singleton(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
in(esk1_0,singleton(esk2_0)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
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.10/0.13 % Problem : SET877+1 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 2400
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Oct 2 17:47:30 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.17/0.45 Running first-order model finding
% 0.17/0.45 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.R0yMcJnNXi/E---3.1_18226.p
% 0.17/0.46 # Version: 3.1pre001
% 0.17/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # new_bool_3 with pid 18304 completed with status 0
% 0.17/0.46 # Result found by new_bool_3
% 0.17/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 # Search class: FGHSS-FFSF21-SFFFFFNN
% 0.17/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.46 # SAT001_MinMin_p005000_rr_RG with pid 18312 completed with status 0
% 0.17/0.46 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 # Search class: FGHSS-FFSF21-SFFFFFNN
% 0.17/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.46 # Preprocessing time : 0.001 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Theorem
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 8
% 0.17/0.46 # Removed by relevancy pruning/SinE : 2
% 0.17/0.46 # Initial clauses : 10
% 0.17/0.46 # Removed in clause preprocessing : 0
% 0.17/0.46 # Initial clauses in saturation : 10
% 0.17/0.46 # Processed clauses : 27
% 0.17/0.46 # ...of these trivial : 0
% 0.17/0.46 # ...subsumed : 0
% 0.17/0.46 # ...remaining for further processing : 27
% 0.17/0.46 # Other redundant clauses eliminated : 3
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 1
% 0.17/0.46 # Backward-rewritten : 0
% 0.17/0.46 # Generated clauses : 20
% 0.17/0.46 # ...of the previous two non-redundant : 14
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 0
% 0.17/0.46 # Paramodulations : 18
% 0.17/0.46 # Factorizations : 0
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 3
% 0.17/0.46 # Total rewrite steps : 4
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 14
% 0.17/0.46 # Positive orientable unit clauses : 4
% 0.17/0.46 # Positive unorientable unit clauses: 1
% 0.17/0.46 # Negative unit clauses : 3
% 0.17/0.46 # Non-unit-clauses : 6
% 0.17/0.46 # Current number of unprocessed clauses: 5
% 0.17/0.46 # ...number of literals in the above : 12
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 11
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 2
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 2
% 0.17/0.46 # Non-unit clause-clause subsumptions : 0
% 0.17/0.46 # Unit Clause-clause subsumption calls : 2
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 10
% 0.17/0.46 # BW rewrite match successes : 8
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 656
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.004 s
% 0.17/0.46 # System time : 0.001 s
% 0.17/0.46 # Total time : 0.005 s
% 0.17/0.46 # Maximum resident set size: 1760 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.005 s
% 0.17/0.46 # System time : 0.001 s
% 0.17/0.46 # Total time : 0.007 s
% 0.17/0.46 # Maximum resident set size: 1676 pages
% 0.17/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------