TSTP Solution File: SET016+4 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET016+4 : TPTP v8.2.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 02:56:55 EDT 2024
% Result : Theorem 0.16s 0.41s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 8 unt; 0 def)
% Number of atoms : 72 ( 23 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 67 ( 24 ~; 27 |; 9 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 50 ( 2 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thI50a,conjecture,
! [X1,X2,X6,X7] :
( equal_set(unordered_pair(singleton(X1),unordered_pair(X1,X2)),unordered_pair(singleton(X6),unordered_pair(X6,X7)))
=> X1 = X6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI50a) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',equal_set) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',subset) ).
fof(unordered_pair,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( X3 = X1
| X3 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',unordered_pair) ).
fof(singleton,axiom,
! [X3,X1] :
( member(X3,singleton(X1))
<=> X3 = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',singleton) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X6,X7] :
( equal_set(unordered_pair(singleton(X1),unordered_pair(X1,X2)),unordered_pair(singleton(X6),unordered_pair(X6,X7)))
=> X1 = X6 ),
inference(assume_negation,[status(cth)],[thI50a]) ).
fof(c_0_6,plain,
! [X12,X13] :
( ( subset(X12,X13)
| ~ equal_set(X12,X13) )
& ( subset(X13,X12)
| ~ equal_set(X12,X13) )
& ( ~ subset(X12,X13)
| ~ subset(X13,X12)
| equal_set(X12,X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])])]) ).
fof(c_0_7,negated_conjecture,
( equal_set(unordered_pair(singleton(esk1_0),unordered_pair(esk1_0,esk2_0)),unordered_pair(singleton(esk3_0),unordered_pair(esk3_0,esk4_0)))
& esk1_0 != esk3_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_8,plain,
! [X19,X20,X21,X22,X23] :
( ( ~ subset(X19,X20)
| ~ member(X21,X19)
| member(X21,X20) )
& ( member(esk5_2(X22,X23),X22)
| subset(X22,X23) )
& ( ~ member(esk5_2(X22,X23),X23)
| subset(X22,X23) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[subset])])])])])])]) ).
cnf(c_0_9,plain,
( subset(X1,X2)
| ~ equal_set(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
equal_set(unordered_pair(singleton(esk1_0),unordered_pair(esk1_0,esk2_0)),unordered_pair(singleton(esk3_0),unordered_pair(esk3_0,esk4_0))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X14,X15,X16] :
( ( ~ member(X14,unordered_pair(X15,X16))
| X14 = X15
| X14 = X16 )
& ( X14 != X15
| member(X14,unordered_pair(X15,X16)) )
& ( X14 != X16
| member(X14,unordered_pair(X15,X16)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair])])])]) ).
cnf(c_0_12,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
subset(unordered_pair(singleton(esk3_0),unordered_pair(esk3_0,esk4_0)),unordered_pair(singleton(esk1_0),unordered_pair(esk1_0,esk2_0))),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( member(X1,unordered_pair(X2,X3))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X17,X18] :
( ( ~ member(X17,singleton(X18))
| X17 = X18 )
& ( X17 != X18
| member(X17,singleton(X18)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[singleton])])]) ).
cnf(c_0_16,negated_conjecture,
( member(X1,unordered_pair(singleton(esk1_0),unordered_pair(esk1_0,esk2_0)))
| ~ member(X1,unordered_pair(singleton(esk3_0),unordered_pair(esk3_0,esk4_0))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
member(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
( member(X1,singleton(X2))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
member(singleton(esk3_0),unordered_pair(singleton(esk1_0),unordered_pair(esk1_0,esk2_0))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
member(X1,singleton(X1)),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( singleton(esk3_0) = unordered_pair(esk1_0,esk2_0)
| singleton(esk3_0) = singleton(esk1_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
( singleton(esk3_0) = unordered_pair(esk1_0,esk2_0)
| member(esk3_0,singleton(esk1_0)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
esk1_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_26,negated_conjecture,
singleton(esk3_0) = unordered_pair(esk1_0,esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_27,negated_conjecture,
( X1 = esk3_0
| ~ member(X1,unordered_pair(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_23,c_0_26]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_17]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : SET016+4 : TPTP v8.2.0. Released v2.2.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n013.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon May 20 11:58:08 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.16/0.40 Running first-order model finding
% 0.16/0.40 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.16/0.41 # Version: 3.1.0
% 0.16/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.41 # Starting sh5l with 300s (1) cores
% 0.16/0.41 # sh5l with pid 1827 completed with status 0
% 0.16/0.41 # Result found by sh5l
% 0.16/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.41 # Starting sh5l with 300s (1) cores
% 0.16/0.41 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.41 # Search class: FGUSF-FFSF21-SFFFFFNN
% 0.16/0.41 # partial match(1): FGHSF-FFSF21-SFFFFFNN
% 0.16/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.41 # SAT001_MinMin_p005000_rr_RG with pid 1830 completed with status 0
% 0.16/0.41 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.41 # Starting sh5l with 300s (1) cores
% 0.16/0.41 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.41 # Search class: FGUSF-FFSF21-SFFFFFNN
% 0.16/0.41 # partial match(1): FGHSF-FFSF21-SFFFFFNN
% 0.16/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.41 # Preprocessing time : 0.001 s
% 0.16/0.41 # Presaturation interreduction done
% 0.16/0.41
% 0.16/0.41 # Proof found!
% 0.16/0.41 # SZS status Theorem
% 0.16/0.41 # SZS output start CNFRefutation
% See solution above
% 0.16/0.41 # Parsed axioms : 12
% 0.16/0.41 # Removed by relevancy pruning/SinE : 6
% 0.16/0.41 # Initial clauses : 15
% 0.16/0.41 # Removed in clause preprocessing : 0
% 0.16/0.41 # Initial clauses in saturation : 15
% 0.16/0.41 # Processed clauses : 52
% 0.16/0.41 # ...of these trivial : 0
% 0.16/0.41 # ...subsumed : 1
% 0.16/0.41 # ...remaining for further processing : 51
% 0.16/0.41 # Other redundant clauses eliminated : 5
% 0.16/0.41 # Clauses deleted for lack of memory : 0
% 0.16/0.41 # Backward-subsumed : 1
% 0.16/0.41 # Backward-rewritten : 3
% 0.16/0.41 # Generated clauses : 83
% 0.16/0.41 # ...of the previous two non-redundant : 69
% 0.16/0.41 # ...aggressively subsumed : 0
% 0.16/0.41 # Contextual simplify-reflections : 0
% 0.16/0.41 # Paramodulations : 75
% 0.16/0.41 # Factorizations : 3
% 0.16/0.41 # NegExts : 0
% 0.16/0.41 # Equation resolutions : 5
% 0.16/0.41 # Disequality decompositions : 0
% 0.16/0.41 # Total rewrite steps : 10
% 0.16/0.41 # ...of those cached : 3
% 0.16/0.41 # Propositional unsat checks : 0
% 0.16/0.41 # Propositional check models : 0
% 0.16/0.41 # Propositional check unsatisfiable : 0
% 0.16/0.41 # Propositional clauses : 0
% 0.16/0.41 # Propositional clauses after purity: 0
% 0.16/0.41 # Propositional unsat core size : 0
% 0.16/0.41 # Propositional preprocessing time : 0.000
% 0.16/0.41 # Propositional encoding time : 0.000
% 0.16/0.41 # Propositional solver time : 0.000
% 0.16/0.41 # Success case prop preproc time : 0.000
% 0.16/0.41 # Success case prop encoding time : 0.000
% 0.16/0.41 # Success case prop solver time : 0.000
% 0.16/0.41 # Current number of processed clauses : 29
% 0.16/0.41 # Positive orientable unit clauses : 8
% 0.16/0.41 # Positive unorientable unit clauses: 0
% 0.16/0.41 # Negative unit clauses : 1
% 0.16/0.41 # Non-unit-clauses : 20
% 0.16/0.41 # Current number of unprocessed clauses: 45
% 0.16/0.41 # ...number of literals in the above : 114
% 0.16/0.41 # Current number of archived formulas : 0
% 0.16/0.41 # Current number of archived clauses : 19
% 0.16/0.41 # Clause-clause subsumption calls (NU) : 58
% 0.16/0.41 # Rec. Clause-clause subsumption calls : 54
% 0.16/0.41 # Non-unit clause-clause subsumptions : 1
% 0.16/0.41 # Unit Clause-clause subsumption calls : 6
% 0.16/0.41 # Rewrite failures with RHS unbound : 0
% 0.16/0.41 # BW rewrite match attempts : 10
% 0.16/0.41 # BW rewrite match successes : 1
% 0.16/0.41 # Condensation attempts : 0
% 0.16/0.41 # Condensation successes : 0
% 0.16/0.41 # Termbank termtop insertions : 1923
% 0.16/0.41 # Search garbage collected termcells : 279
% 0.16/0.41
% 0.16/0.41 # -------------------------------------------------
% 0.16/0.41 # User time : 0.002 s
% 0.16/0.41 # System time : 0.003 s
% 0.16/0.41 # Total time : 0.005 s
% 0.16/0.41 # Maximum resident set size: 1688 pages
% 0.16/0.41
% 0.16/0.41 # -------------------------------------------------
% 0.16/0.41 # User time : 0.004 s
% 0.16/0.41 # System time : 0.003 s
% 0.16/0.41 # Total time : 0.008 s
% 0.16/0.41 # Maximum resident set size: 1708 pages
% 0.16/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------