TSTP Solution File: SET891+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET891+1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:19 EDT 2024
% Result : Theorem 0.18s 0.45s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 12 unt; 0 def)
% Number of atoms : 12 ( 11 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t32_zfmisc_1,conjecture,
! [X1,X2] : union(unordered_pair(singleton(X1),singleton(X2))) = unordered_pair(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t32_zfmisc_1) ).
fof(l52_zfmisc_1,axiom,
! [X1,X2] : union(unordered_pair(X1,X2)) = set_union2(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l52_zfmisc_1) ).
fof(t41_enumset1,axiom,
! [X1,X2] : unordered_pair(X1,X2) = set_union2(singleton(X1),singleton(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t41_enumset1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] : union(unordered_pair(singleton(X1),singleton(X2))) = unordered_pair(X1,X2),
inference(assume_negation,[status(cth)],[t32_zfmisc_1]) ).
fof(c_0_4,negated_conjecture,
union(unordered_pair(singleton(esk1_0),singleton(esk2_0))) != unordered_pair(esk1_0,esk2_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
fof(c_0_5,plain,
! [X7,X8] : union(unordered_pair(X7,X8)) = set_union2(X7,X8),
inference(variable_rename,[status(thm)],[l52_zfmisc_1]) ).
cnf(c_0_6,negated_conjecture,
union(unordered_pair(singleton(esk1_0),singleton(esk2_0))) != unordered_pair(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
union(unordered_pair(X1,X2)) = set_union2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X9,X10] : unordered_pair(X9,X10) = set_union2(singleton(X9),singleton(X10)),
inference(variable_rename,[status(thm)],[t41_enumset1]) ).
cnf(c_0_9,negated_conjecture,
set_union2(singleton(esk1_0),singleton(esk2_0)) != unordered_pair(esk1_0,esk2_0),
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
unordered_pair(X1,X2) = set_union2(singleton(X1),singleton(X2)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : SET891+1 : TPTP v8.2.0. Released v3.2.0.
% 0.05/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n015.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 20 12:30:53 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.44 Running first-order model finding
% 0.18/0.44 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 # Version: 3.1.0
% 0.18/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.45 # Starting sh5l with 300s (1) cores
% 0.18/0.45 # new_bool_3 with pid 4161 completed with status 0
% 0.18/0.45 # Result found by new_bool_3
% 0.18/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.45 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.18/0.45 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.45 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.18/0.45 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 4164 completed with status 0
% 0.18/0.45 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.45 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.18/0.45 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.45 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.18/0.45 # Preprocessing time : 0.001 s
% 0.18/0.45 # Presaturation interreduction done
% 0.18/0.45
% 0.18/0.45 # Proof found!
% 0.18/0.45 # SZS status Theorem
% 0.18/0.45 # SZS output start CNFRefutation
% See solution above
% 0.18/0.45 # Parsed axioms : 10
% 0.18/0.45 # Removed by relevancy pruning/SinE : 0
% 0.18/0.45 # Initial clauses : 10
% 0.18/0.45 # Removed in clause preprocessing : 0
% 0.18/0.45 # Initial clauses in saturation : 10
% 0.18/0.45 # Processed clauses : 11
% 0.18/0.45 # ...of these trivial : 0
% 0.18/0.45 # ...subsumed : 0
% 0.18/0.45 # ...remaining for further processing : 11
% 0.18/0.45 # Other redundant clauses eliminated : 0
% 0.18/0.45 # Clauses deleted for lack of memory : 0
% 0.18/0.45 # Backward-subsumed : 0
% 0.18/0.45 # Backward-rewritten : 2
% 0.18/0.45 # Generated clauses : 0
% 0.18/0.45 # ...of the previous two non-redundant : 1
% 0.18/0.45 # ...aggressively subsumed : 0
% 0.18/0.45 # Contextual simplify-reflections : 0
% 0.18/0.45 # Paramodulations : 0
% 0.18/0.45 # Factorizations : 0
% 0.18/0.45 # NegExts : 0
% 0.18/0.45 # Equation resolutions : 0
% 0.18/0.45 # Disequality decompositions : 0
% 0.18/0.45 # Total rewrite steps : 2
% 0.18/0.45 # ...of those cached : 0
% 0.18/0.45 # Propositional unsat checks : 0
% 0.18/0.45 # Propositional check models : 0
% 0.18/0.45 # Propositional check unsatisfiable : 0
% 0.18/0.45 # Propositional clauses : 0
% 0.18/0.45 # Propositional clauses after purity: 0
% 0.18/0.45 # Propositional unsat core size : 0
% 0.18/0.45 # Propositional preprocessing time : 0.000
% 0.18/0.45 # Propositional encoding time : 0.000
% 0.18/0.45 # Propositional solver time : 0.000
% 0.18/0.45 # Success case prop preproc time : 0.000
% 0.18/0.45 # Success case prop encoding time : 0.000
% 0.18/0.45 # Success case prop solver time : 0.000
% 0.18/0.45 # Current number of processed clauses : 9
% 0.18/0.45 # Positive orientable unit clauses : 4
% 0.18/0.45 # Positive unorientable unit clauses: 2
% 0.18/0.45 # Negative unit clauses : 1
% 0.18/0.45 # Non-unit-clauses : 2
% 0.18/0.45 # Current number of unprocessed clauses: 0
% 0.18/0.45 # ...number of literals in the above : 0
% 0.18/0.45 # Current number of archived formulas : 0
% 0.18/0.45 # Current number of archived clauses : 2
% 0.18/0.45 # Clause-clause subsumption calls (NU) : 2
% 0.18/0.45 # Rec. Clause-clause subsumption calls : 2
% 0.18/0.45 # Non-unit clause-clause subsumptions : 0
% 0.18/0.45 # Unit Clause-clause subsumption calls : 0
% 0.18/0.45 # Rewrite failures with RHS unbound : 0
% 0.18/0.45 # BW rewrite match attempts : 8
% 0.18/0.45 # BW rewrite match successes : 8
% 0.18/0.45 # Condensation attempts : 0
% 0.18/0.45 # Condensation successes : 0
% 0.18/0.45 # Termbank termtop insertions : 399
% 0.18/0.45 # Search garbage collected termcells : 46
% 0.18/0.45
% 0.18/0.45 # -------------------------------------------------
% 0.18/0.45 # User time : 0.004 s
% 0.18/0.45 # System time : 0.000 s
% 0.18/0.45 # Total time : 0.004 s
% 0.18/0.45 # Maximum resident set size: 1732 pages
% 0.18/0.45
% 0.18/0.45 # -------------------------------------------------
% 0.18/0.45 # User time : 0.006 s
% 0.18/0.45 # System time : 0.000 s
% 0.18/0.45 # Total time : 0.006 s
% 0.18/0.45 # Maximum resident set size: 1692 pages
% 0.18/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------