TSTP Solution File: SET788+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET788+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:55:59 EDT 2024
% Result : Timeout 300.18s 100.44s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 20 ( 4 unt; 0 def)
% Number of atoms : 63 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 66 ( 23 ~; 30 |; 5 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
( ! [X1,X2] :
( equalish(X1,X2)
<=> ! [X3] :
( a_member_of(X3,X1)
<=> a_member_of(X3,X2) ) )
=> ! [X1,X2] :
( equalish(X1,X2)
<=> equalish(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(c_0_1,negated_conjecture,
~ ( ! [X1,X2] :
( equalish(X1,X2)
<=> ! [X3] :
( a_member_of(X3,X1)
<=> a_member_of(X3,X2) ) )
=> ! [X1,X2] :
( equalish(X1,X2)
<=> equalish(X2,X1) ) ),
inference(assume_negation,[status(cth)],[prove_this]) ).
fof(c_0_2,negated_conjecture,
! [X4,X5,X6,X7,X8,X9] :
( ( ~ a_member_of(X6,X4)
| a_member_of(X6,X5)
| ~ equalish(X4,X5) )
& ( ~ a_member_of(X7,X5)
| a_member_of(X7,X4)
| ~ equalish(X4,X5) )
& ( ~ a_member_of(esk1_2(X8,X9),X8)
| ~ a_member_of(esk1_2(X8,X9),X9)
| equalish(X8,X9) )
& ( a_member_of(esk1_2(X8,X9),X8)
| a_member_of(esk1_2(X8,X9),X9)
| equalish(X8,X9) )
& ( ~ equalish(esk2_0,esk3_0)
| ~ equalish(esk3_0,esk2_0) )
& ( equalish(esk2_0,esk3_0)
| equalish(esk3_0,esk2_0) ) ),
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)],[c_0_1])])])])])])]) ).
cnf(c_0_3,negated_conjecture,
( a_member_of(X1,X3)
| ~ a_member_of(X1,X2)
| ~ equalish(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( equalish(esk2_0,esk3_0)
| equalish(esk3_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( a_member_of(X1,X3)
| ~ a_member_of(X1,X2)
| ~ equalish(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( a_member_of(X1,esk3_0)
| ~ a_member_of(X1,esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]) ).
cnf(c_0_7,negated_conjecture,
( a_member_of(esk1_2(X1,X2),X1)
| a_member_of(esk1_2(X1,X2),X2)
| equalish(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
( a_member_of(esk1_2(esk2_0,X1),esk3_0)
| a_member_of(esk1_2(esk2_0,X1),X1)
| equalish(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
( equalish(X1,X2)
| ~ a_member_of(esk1_2(X1,X2),X1)
| ~ a_member_of(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( a_member_of(esk1_2(esk2_0,esk3_0),esk3_0)
| equalish(esk2_0,esk3_0) ),
inference(ef,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( equalish(esk2_0,esk3_0)
| ~ a_member_of(esk1_2(esk2_0,esk3_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
( a_member_of(X1,esk2_0)
| ~ a_member_of(X1,esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_4]),c_0_3]) ).
cnf(c_0_13,negated_conjecture,
( ~ equalish(esk2_0,esk3_0)
| ~ equalish(esk3_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
equalish(esk2_0,esk3_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( a_member_of(esk1_2(X1,esk2_0),esk3_0)
| a_member_of(esk1_2(X1,esk2_0),X1)
| equalish(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_16,negated_conjecture,
~ equalish(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_17,negated_conjecture,
( equalish(X1,esk2_0)
| ~ a_member_of(esk1_2(X1,esk2_0),esk3_0)
| ~ a_member_of(esk1_2(X1,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_18,negated_conjecture,
a_member_of(esk1_2(esk3_0,esk2_0),esk3_0),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_15]),c_0_16]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_18])]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET788+1 : TPTP v8.2.0. Released v3.1.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 13:21:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 300.18/100.44 # Version: 3.1.0
% 300.18/100.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 300.18/100.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 300.18/100.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 300.18/100.44 # Starting new_bool_3 with 300s (1) cores
% 300.18/100.44 # Starting new_bool_1 with 300s (1) cores
% 300.18/100.44 # Starting sh5l with 300s (1) cores
% 300.18/100.44 # new_bool_3 with pid 10453 completed with status 0
% 300.18/100.44 # Result found by new_bool_3
% 300.18/100.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 300.18/100.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 300.18/100.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 300.18/100.44 # Starting new_bool_3 with 300s (1) cores
% 300.18/100.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 300.18/100.44 # Search class: FGHNF-FFSF22-SFFFFFNN
% 300.18/100.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 300.18/100.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 300.18/100.44 # SAT001_MinMin_p005000_rr_RG with pid 10458 completed with status 0
% 300.18/100.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 300.18/100.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 300.18/100.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 300.18/100.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 300.18/100.44 # Starting new_bool_3 with 300s (1) cores
% 300.18/100.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 300.18/100.44 # Search class: FGHNF-FFSF22-SFFFFFNN
% 300.18/100.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 300.18/100.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 300.18/100.44 # Preprocessing time : 0.001 s
% 300.18/100.44 # Presaturation interreduction done
% 300.18/100.44
% 300.18/100.44 # Proof found!
% 300.18/100.44 # SZS status Theorem
% 300.18/100.44 # SZS output start CNFRefutation
% See solution above
% 300.18/100.44 # Parsed axioms : 1
% 300.18/100.44 # Removed by relevancy pruning/SinE : 0
% 300.18/100.44 # Initial clauses : 6
% 300.18/100.44 # Removed in clause preprocessing : 0
% 300.18/100.44 # Initial clauses in saturation : 6
% 300.18/100.44 # Processed clauses : 30
% 300.18/100.44 # ...of these trivial : 3
% 300.18/100.44 # ...subsumed : 3
% 300.18/100.44 # ...remaining for further processing : 24
% 300.18/100.44 # Other redundant clauses eliminated : 0
% 300.18/100.44 # Clauses deleted for lack of memory : 0
% 300.18/100.44 # Backward-subsumed : 1
% 300.18/100.44 # Backward-rewritten : 4
% 300.18/100.44 # Generated clauses : 29
% 300.18/100.44 # ...of the previous two non-redundant : 21
% 300.18/100.44 # ...aggressively subsumed : 0
% 300.18/100.44 # Contextual simplify-reflections : 4
% 300.18/100.44 # Paramodulations : 23
% 300.18/100.44 # Factorizations : 6
% 300.18/100.44 # NegExts : 0
% 300.18/100.44 # Equation resolutions : 0
% 300.18/100.44 # Disequality decompositions : 0
% 300.18/100.44 # Total rewrite steps : 10
% 300.18/100.44 # ...of those cached : 5
% 300.18/100.44 # Propositional unsat checks : 0
% 300.18/100.44 # Propositional check models : 0
% 300.18/100.44 # Propositional check unsatisfiable : 0
% 300.18/100.44 # Propositional clauses : 0
% 300.18/100.44 # Propositional clauses after purity: 0
% 300.18/100.44 # Propositional unsat core size : 0
% 300.18/100.44 # Propositional preprocessing time : 0.000
% 300.18/100.44 # Propositional encoding time : 0.000
% 300.18/100.44 # Propositional solver time : 0.000
% 300.18/100.44 # Success case prop preproc time : 0.000
% 300.18/100.44 # Success case prop encoding time : 0.000
% 300.18/100.44 # Success case prop solver time : 0.000
% 300.18/100.44 # Current number of processed clauses : 13
% 300.18/100.44 # Positive orientable unit clauses : 3
% 300.18/100.44 # Positive unorientable unit clauses: 0
% 300.18/100.44 # Negative unit clauses : 1
% 300.18/100.44 # Non-unit-clauses : 9
% 300.18/100.44 # Current number of unprocessed clauses: 1
% 300.18/100.44 # ...number of literals in the above : 1
% 300.18/100.44 # Current number of archived formulas : 0
% 300.18/100.44 # Current number of archived clauses : 11
% 300.18/100.44 # Clause-clause subsumption calls (NU) : 26
% 300.18/100.44 # Rec. Clause-clause subsumption calls : 20
% 300.18/100.44 # Non-unit clause-clause subsumptions : 7
% 300.18/100.44 # Unit Clause-clause subsumption calls : 8
% 300.18/100.44 # Rewrite failures with RHS unbound : 0
% 300.18/100.44 # BW rewrite match attempts : 9
% 300.18/100.44 # BW rewrite match successes : 2
% 300.18/100.44 # Condensation attempts : 0
% 300.18/100.44 # Condensation successes : 0
% 300.18/100.44 # Termbank termtop insertions : 972
% 300.18/100.44 # Search garbage collected termcells : 221
% 300.18/100.44
% 300.18/100.44 # -------------------------------------------------
% 300.18/100.44 # User time : 0.003 s
% 300.18/100.44 # System time : 0.002 s
% 300.18/100.44 # Total time : 0.004 s
% 300.18/100.44 # Maximum resident set size: 1732 pages
% 300.18/100.44
% 300.18/100.44 # -------------------------------------------------
% 300.18/100.44 # User time : 0.005 s
% 300.18/100.44 # System time : 0.003 s
% 300.18/100.44 # Total time : 0.007 s
% 300.18/100.44 # Maximum resident set size: 1684 pages
% 300.18/100.44 % E---3.1 exiting
% 300.18/100.44 % E exiting
%------------------------------------------------------------------------------