TSTP Solution File: SET891+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET891+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 : Sat May 4 09:21:06 EDT 2024
% Result : Theorem 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% 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 : 3 ( 3 ~; 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 : 18 ( 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/tmp/tmp.L7CcGfxxpM/E---3.1_19272.p',t32_zfmisc_1) ).
fof(t41_enumset1,axiom,
! [X1,X2] : unordered_pair(X1,X2) = set_union2(singleton(X1),singleton(X2)),
file('/export/starexec/sandbox2/tmp/tmp.L7CcGfxxpM/E---3.1_19272.p',t41_enumset1) ).
fof(l52_zfmisc_1,axiom,
! [X1,X2] : union(unordered_pair(X1,X2)) = set_union2(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.L7CcGfxxpM/E---3.1_19272.p',l52_zfmisc_1) ).
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,plain,
! [X18,X19] : unordered_pair(X18,X19) = set_union2(singleton(X18),singleton(X19)),
inference(variable_rename,[status(thm)],[t41_enumset1]) ).
fof(c_0_5,plain,
! [X12,X13] : union(unordered_pair(X12,X13)) = set_union2(X12,X13),
inference(variable_rename,[status(thm)],[l52_zfmisc_1]) ).
fof(c_0_6,negated_conjecture,
union(unordered_pair(singleton(esk3_0),singleton(esk4_0))) != unordered_pair(esk3_0,esk4_0),
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_7,plain,
unordered_pair(X1,X2) = set_union2(singleton(X1),singleton(X2)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
union(unordered_pair(X1,X2)) = set_union2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
union(unordered_pair(singleton(esk3_0),singleton(esk4_0))) != unordered_pair(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
unordered_pair(X1,X2) = union(unordered_pair(singleton(X1),singleton(X2))),
inference(rw,[status(thm)],[c_0_7,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.12/0.12 % Problem : SET891+1 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 10:21:49 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.49 Running first-order theorem proving
% 0.19/0.49 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.L7CcGfxxpM/E---3.1_19272.p
% 0.19/0.50 # Version: 3.1.0
% 0.19/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 19412 completed with status 0
% 0.19/0.50 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.19/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.19/0.50 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.19/0.50 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.19/0.50 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2U with 136s (1) cores
% 0.19/0.50 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 19418 completed with status 0
% 0.19/0.50 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.19/0.50 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.50 # Preprocessing time : 0.001 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Theorem
% 0.19/0.50 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 10
% 0.19/0.50 # Removed by relevancy pruning/SinE : 0
% 0.19/0.50 # Initial clauses : 10
% 0.19/0.50 # Removed in clause preprocessing : 1
% 0.19/0.50 # Initial clauses in saturation : 9
% 0.19/0.50 # Processed clauses : 5
% 0.19/0.50 # ...of these trivial : 0
% 0.19/0.50 # ...subsumed : 0
% 0.19/0.50 # ...remaining for further processing : 5
% 0.19/0.50 # Other redundant clauses eliminated : 0
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 0
% 0.19/0.50 # Backward-rewritten : 1
% 0.19/0.50 # Generated clauses : 0
% 0.19/0.50 # ...of the previous two non-redundant : 0
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 0
% 0.19/0.50 # Paramodulations : 0
% 0.19/0.50 # Factorizations : 0
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 0
% 0.19/0.50 # Disequality decompositions : 0
% 0.19/0.50 # Total rewrite steps : 1
% 0.19/0.50 # ...of those cached : 0
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 4
% 0.19/0.50 # Positive orientable unit clauses : 3
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 1
% 0.19/0.50 # Non-unit-clauses : 0
% 0.19/0.50 # Current number of unprocessed clauses: 4
% 0.19/0.50 # ...number of literals in the above : 6
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 2
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.50 # Non-unit clause-clause subsumptions : 0
% 0.19/0.50 # Unit Clause-clause subsumption calls : 0
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 2
% 0.19/0.50 # BW rewrite match successes : 1
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 389
% 0.19/0.50 # Search garbage collected termcells : 46
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.005 s
% 0.19/0.50 # System time : 0.001 s
% 0.19/0.50 # Total time : 0.006 s
% 0.19/0.50 # Maximum resident set size: 1712 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.010 s
% 0.19/0.50 # System time : 0.008 s
% 0.19/0.50 # Total time : 0.018 s
% 0.19/0.50 # Maximum resident set size: 1692 pages
% 0.19/0.50 % E---3.1 exiting
% 0.19/0.50 % E exiting
%------------------------------------------------------------------------------