TSTP Solution File: SET903+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET903+1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 03:00:21 EDT 2024
% Result : Theorem 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 7 unt; 0 def)
% Number of atoms : 76 ( 75 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 91 ( 33 ~; 36 |; 22 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 26 ( 4 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t43_zfmisc_1,axiom,
! [X1,X2,X3] :
~ ( singleton(X1) = set_union2(X2,X3)
& ~ ( X2 = singleton(X1)
& X3 = singleton(X1) )
& ~ ( X2 = empty_set
& X3 = singleton(X1) )
& ~ ( X2 = singleton(X1)
& X3 = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t43_zfmisc_1) ).
fof(t44_zfmisc_1,conjecture,
! [X1,X2,X3] :
~ ( singleton(X1) = set_union2(X2,X3)
& X2 != X3
& X2 != empty_set
& X3 != empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t44_zfmisc_1) ).
fof(c_0_2,plain,
! [X7,X8,X9] :
( ( X8 = singleton(X7)
| X8 = empty_set
| X8 = singleton(X7)
| singleton(X7) != set_union2(X8,X9) )
& ( X9 = empty_set
| X8 = empty_set
| X8 = singleton(X7)
| singleton(X7) != set_union2(X8,X9) )
& ( X8 = singleton(X7)
| X9 = singleton(X7)
| X8 = singleton(X7)
| singleton(X7) != set_union2(X8,X9) )
& ( X9 = empty_set
| X9 = singleton(X7)
| X8 = singleton(X7)
| singleton(X7) != set_union2(X8,X9) )
& ( X8 = singleton(X7)
| X8 = empty_set
| X9 = singleton(X7)
| singleton(X7) != set_union2(X8,X9) )
& ( X9 = empty_set
| X8 = empty_set
| X9 = singleton(X7)
| singleton(X7) != set_union2(X8,X9) )
& ( X8 = singleton(X7)
| X9 = singleton(X7)
| X9 = singleton(X7)
| singleton(X7) != set_union2(X8,X9) )
& ( X9 = empty_set
| X9 = singleton(X7)
| X9 = singleton(X7)
| singleton(X7) != set_union2(X8,X9) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t43_zfmisc_1])])])]) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
~ ( singleton(X1) = set_union2(X2,X3)
& X2 != X3
& X2 != empty_set
& X3 != empty_set ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t44_zfmisc_1])]) ).
cnf(c_0_4,plain,
( X1 = empty_set
| X1 = singleton(X2)
| X1 = singleton(X2)
| singleton(X2) != set_union2(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
fof(c_0_5,negated_conjecture,
( singleton(esk1_0) = set_union2(esk2_0,esk3_0)
& esk2_0 != esk3_0
& esk2_0 != empty_set
& esk3_0 != empty_set ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_6,plain,
( X1 = empty_set
| X1 = singleton(X2)
| singleton(X2) != set_union2(X3,X1) ),
inference(cn,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
singleton(esk1_0) = set_union2(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
esk3_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( singleton(X1) = esk3_0
| singleton(X1) != singleton(esk1_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_10,plain,
( X1 = singleton(X2)
| X1 = empty_set
| X1 = singleton(X2)
| singleton(X2) != set_union2(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
singleton(esk1_0) = esk3_0,
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( X1 = empty_set
| X1 = singleton(X2)
| singleton(X2) != set_union2(X1,X3) ),
inference(cn,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
set_union2(esk2_0,esk3_0) = esk3_0,
inference(rw,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
esk2_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
( singleton(X1) = esk2_0
| singleton(X1) != esk3_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_16,negated_conjecture,
esk2_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_11]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SET903+1 : TPTP v8.2.0. Released v3.2.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n020.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 : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon May 20 11:10:52 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 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/benchmark/theBenchmark.p
% 0.15/0.42 # Version: 3.1.0
% 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 # new_bool_3 with pid 27382 completed with status 0
% 0.15/0.42 # Result found by new_bool_3
% 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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FGUSS-FFSS21-SFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.42 # SAT001_MinMin_p005000_rr_RG with pid 27386 completed with status 0
% 0.15/0.42 # Result found by SAT001_MinMin_p005000_rr_RG
% 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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FGUSS-FFSS21-SFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting SAT001_MinMin_p005000_rr_RG 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 : 9
% 0.15/0.42 # Removed by relevancy pruning/SinE : 0
% 0.15/0.42 # Initial clauses : 19
% 0.15/0.42 # Removed in clause preprocessing : 0
% 0.15/0.42 # Initial clauses in saturation : 19
% 0.15/0.42 # Processed clauses : 37
% 0.15/0.42 # ...of these trivial : 0
% 0.15/0.42 # ...subsumed : 5
% 0.15/0.42 # ...remaining for further processing : 32
% 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 : 2
% 0.15/0.42 # Generated clauses : 23
% 0.15/0.42 # ...of the previous two non-redundant : 15
% 0.15/0.42 # ...aggressively subsumed : 0
% 0.15/0.42 # Contextual simplify-reflections : 0
% 0.15/0.42 # Paramodulations : 22
% 0.15/0.42 # Factorizations : 0
% 0.15/0.42 # NegExts : 0
% 0.15/0.42 # Equation resolutions : 1
% 0.15/0.42 # Disequality decompositions : 0
% 0.15/0.42 # Total rewrite steps : 4
% 0.15/0.42 # ...of those cached : 2
% 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 : 16
% 0.15/0.42 # Positive orientable unit clauses : 5
% 0.15/0.42 # Positive unorientable unit clauses: 1
% 0.15/0.42 # Negative unit clauses : 4
% 0.15/0.42 # Non-unit-clauses : 6
% 0.15/0.42 # Current number of unprocessed clauses: 9
% 0.15/0.42 # ...number of literals in the above : 23
% 0.15/0.42 # Current number of archived formulas : 0
% 0.15/0.42 # Current number of archived clauses : 16
% 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 : 5
% 0.15/0.42 # Unit Clause-clause subsumption calls : 0
% 0.15/0.42 # Rewrite failures with RHS unbound : 0
% 0.15/0.42 # BW rewrite match attempts : 15
% 0.15/0.42 # BW rewrite match successes : 13
% 0.15/0.42 # Condensation attempts : 0
% 0.15/0.42 # Condensation successes : 0
% 0.15/0.42 # Termbank termtop insertions : 801
% 0.15/0.42 # Search garbage collected termcells : 121
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.005 s
% 0.15/0.42 # System time : 0.000 s
% 0.15/0.42 # Total time : 0.005 s
% 0.15/0.42 # Maximum resident set size: 1736 pages
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.008 s
% 0.15/0.42 # System time : 0.000 s
% 0.15/0.42 # Total time : 0.008 s
% 0.15/0.42 # Maximum resident set size: 1692 pages
% 0.15/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------