TSTP Solution File: CSR081+4 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR081+4 : TPTP v8.1.2. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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 07:35:57 EDT 2024
% Result : Theorem 22.72s 4.35s
% Output : CNFRefutation 22.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 11 unt; 0 def)
% Number of atoms : 153 ( 25 equ)
% Maximal formula atoms : 45 ( 3 avg)
% Number of connectives : 180 ( 67 ~; 75 |; 28 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 80 ( 26 sgn 31 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_from_SUMO,conjecture,
( s__mother(s__Bill7_1,s__Jane7_1)
& s__mother(s__Bob7_1,s__Jane7_1) ),
file('/export/starexec/sandbox2/tmp/tmp.WHwHhVNcLN/E---3.1_8016.p',prove_from_SUMO) ).
fof(local_4,axiom,
s__mother(s__Bill7_1,s__Jane7_1),
file('/export/starexec/sandbox2/tmp/tmp.WHwHhVNcLN/E---3.1_8016.p',local_4) ).
fof(kb_SUMO_3496,axiom,
! [X171,X172,X173] :
( X172 = s__UnionFn(X173,X171)
<=> ! [X174,X175,X176] :
( ( s__instance(X173,s__SetOrClass)
& s__instance(X172,s__SetOrClass)
& s__instance(X171,s__SetOrClass) )
=> ( ( s__instance(X174,X173)
& s__instance(X175,X171)
& s__instance(X176,X172) )
=> ( s__instance(X174,X172)
& s__instance(X175,X172)
& ( s__instance(X176,X173)
| s__instance(X176,X171) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WHwHhVNcLN/E---3.1_8016.p',kb_SUMO_3496) ).
fof(kb_SUMO_3533,axiom,
! [X168] :
( s__instance(X168,s__SetOrClass)
=> ( s__instance(X168,s__NullSet)
=> ~ ? [X48] : s__instance(X48,X168) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WHwHhVNcLN/E---3.1_8016.p',kb_SUMO_3533) ).
fof(kb_SUMO_276,axiom,
! [X9,X10] :
( s__disjoint(X9,X10)
<=> ! [X48] :
( ( s__instance(X10,s__SetOrClass)
& s__instance(X9,s__SetOrClass) )
=> ~ ( s__instance(X48,X9)
& s__instance(X48,X10) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WHwHhVNcLN/E---3.1_8016.p',kb_SUMO_276) ).
fof(kb_SUMO_3489,axiom,
! [X169,X170] :
( ! [X49] :
( ( s__instance(X170,s__Set)
& s__instance(X169,s__Set) )
=> ( s__element(X49,X170)
<=> s__element(X49,X169) ) )
=> X170 = X169 ),
file('/export/starexec/sandbox2/tmp/tmp.WHwHhVNcLN/E---3.1_8016.p',kb_SUMO_3489) ).
fof(c_0_6,negated_conjecture,
~ ( s__mother(s__Bill7_1,s__Jane7_1)
& s__mother(s__Bob7_1,s__Jane7_1) ),
inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).
fof(c_0_7,negated_conjecture,
( ~ s__mother(s__Bill7_1,s__Jane7_1)
| ~ s__mother(s__Bob7_1,s__Jane7_1) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
cnf(c_0_8,negated_conjecture,
( ~ s__mother(s__Bill7_1,s__Jane7_1)
| ~ s__mother(s__Bob7_1,s__Jane7_1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_9,plain,
s__mother(s__Bill7_1,s__Jane7_1),
inference(split_conjunct,[status(thm)],[local_4]) ).
fof(c_0_10,plain,
! [X6422,X6423,X6424,X6425,X6426,X6427,X6428,X6429,X6430] :
( ( s__instance(X6425,X6423)
| ~ s__instance(X6425,X6424)
| ~ s__instance(X6426,X6422)
| ~ s__instance(X6427,X6423)
| ~ s__instance(X6424,s__SetOrClass)
| ~ s__instance(X6423,s__SetOrClass)
| ~ s__instance(X6422,s__SetOrClass)
| X6423 != s__UnionFn(X6424,X6422) )
& ( s__instance(X6426,X6423)
| ~ s__instance(X6425,X6424)
| ~ s__instance(X6426,X6422)
| ~ s__instance(X6427,X6423)
| ~ s__instance(X6424,s__SetOrClass)
| ~ s__instance(X6423,s__SetOrClass)
| ~ s__instance(X6422,s__SetOrClass)
| X6423 != s__UnionFn(X6424,X6422) )
& ( s__instance(X6427,X6424)
| s__instance(X6427,X6422)
| ~ s__instance(X6425,X6424)
| ~ s__instance(X6426,X6422)
| ~ s__instance(X6427,X6423)
| ~ s__instance(X6424,s__SetOrClass)
| ~ s__instance(X6423,s__SetOrClass)
| ~ s__instance(X6422,s__SetOrClass)
| X6423 != s__UnionFn(X6424,X6422) )
& ( s__instance(X6430,s__SetOrClass)
| X6429 = s__UnionFn(X6430,X6428) )
& ( s__instance(X6429,s__SetOrClass)
| X6429 = s__UnionFn(X6430,X6428) )
& ( s__instance(X6428,s__SetOrClass)
| X6429 = s__UnionFn(X6430,X6428) )
& ( s__instance(esk158_3(X6428,X6429,X6430),X6430)
| X6429 = s__UnionFn(X6430,X6428) )
& ( s__instance(esk159_3(X6428,X6429,X6430),X6428)
| X6429 = s__UnionFn(X6430,X6428) )
& ( s__instance(esk160_3(X6428,X6429,X6430),X6429)
| X6429 = s__UnionFn(X6430,X6428) )
& ( ~ s__instance(esk160_3(X6428,X6429,X6430),X6430)
| ~ s__instance(esk158_3(X6428,X6429,X6430),X6429)
| ~ s__instance(esk159_3(X6428,X6429,X6430),X6429)
| X6429 = s__UnionFn(X6430,X6428) )
& ( ~ s__instance(esk160_3(X6428,X6429,X6430),X6428)
| ~ s__instance(esk158_3(X6428,X6429,X6430),X6429)
| ~ s__instance(esk159_3(X6428,X6429,X6430),X6429)
| X6429 = s__UnionFn(X6430,X6428) ) ),
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)],[kb_SUMO_3496])])])])])])]) ).
cnf(c_0_11,negated_conjecture,
~ s__mother(s__Bob7_1,s__Jane7_1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).
cnf(c_0_12,plain,
( s__instance(X1,s__SetOrClass)
| X2 = s__UnionFn(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( s__instance(X1,s__SetOrClass)
| ~ s__mother(s__UnionFn(X2,X1),s__Jane7_1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_14,plain,
! [X6434,X6435] :
( ~ s__instance(X6434,s__SetOrClass)
| ~ s__instance(X6434,s__NullSet)
| ~ s__instance(X6435,X6434) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3533])])])]) ).
cnf(c_0_15,negated_conjecture,
( s__instance(X1,s__SetOrClass)
| ~ s__mother(X2,s__Jane7_1) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_16,plain,
( ~ s__instance(X1,s__SetOrClass)
| ~ s__instance(X1,s__NullSet)
| ~ s__instance(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,negated_conjecture,
s__instance(X1,s__SetOrClass),
inference(spm,[status(thm)],[c_0_15,c_0_9]) ).
fof(c_0_18,plain,
! [X1512,X1513,X1514,X1515,X1516] :
( ( ~ s__disjoint(X1512,X1513)
| ~ s__instance(X1513,s__SetOrClass)
| ~ s__instance(X1512,s__SetOrClass)
| ~ s__instance(X1514,X1512)
| ~ s__instance(X1514,X1513) )
& ( s__instance(X1516,s__SetOrClass)
| s__disjoint(X1515,X1516) )
& ( s__instance(X1515,s__SetOrClass)
| s__disjoint(X1515,X1516) )
& ( s__instance(esk1_2(X1515,X1516),X1515)
| s__disjoint(X1515,X1516) )
& ( s__instance(esk1_2(X1515,X1516),X1516)
| s__disjoint(X1515,X1516) ) ),
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)],[kb_SUMO_276])])])])])])]) ).
cnf(c_0_19,plain,
( ~ s__instance(X1,s__NullSet)
| ~ s__instance(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_20,plain,
( s__instance(esk1_2(X1,X2),X1)
| s__disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
( s__disjoint(s__NullSet,X1)
| ~ s__instance(X2,esk1_2(s__NullSet,X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,plain,
( s__instance(esk158_3(X1,X2,X3),X3)
| X2 = s__UnionFn(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,plain,
( X1 = s__UnionFn(esk1_2(s__NullSet,X2),X3)
| s__disjoint(s__NullSet,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,plain,
( X1 = X2
| s__disjoint(s__NullSet,X3) ),
inference(spm,[status(thm)],[c_0_23,c_0_23]) ).
fof(c_0_25,plain,
! [X6419,X6420] :
( ( s__instance(X6420,s__Set)
| X6420 = X6419 )
& ( s__instance(X6419,s__Set)
| X6420 = X6419 )
& ( ~ s__element(esk157_2(X6419,X6420),X6420)
| ~ s__element(esk157_2(X6419,X6420),X6419)
| X6420 = X6419 )
& ( s__element(esk157_2(X6419,X6420),X6420)
| s__element(esk157_2(X6419,X6420),X6419)
| X6420 = X6419 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3489])])])])])]) ).
cnf(c_0_26,plain,
( ~ s__disjoint(X1,X2)
| ~ s__instance(X2,s__SetOrClass)
| ~ s__instance(X1,s__SetOrClass)
| ~ s__instance(X3,X1)
| ~ s__instance(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,negated_conjecture,
( s__disjoint(s__NullSet,X1)
| ~ s__mother(X2,s__Jane7_1) ),
inference(spm,[status(thm)],[c_0_11,c_0_24]) ).
cnf(c_0_28,plain,
( s__instance(X1,s__Set)
| X2 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,plain,
( ~ s__disjoint(X1,X2)
| ~ s__instance(X3,X2)
| ~ s__instance(X3,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_17]),c_0_17])]) ).
cnf(c_0_30,negated_conjecture,
s__disjoint(s__NullSet,X1),
inference(spm,[status(thm)],[c_0_27,c_0_9]) ).
cnf(c_0_31,negated_conjecture,
( s__instance(X1,s__Set)
| ~ s__mother(X1,s__Jane7_1) ),
inference(spm,[status(thm)],[c_0_11,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( ~ s__instance(X1,s__NullSet)
| ~ s__instance(X1,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
s__instance(s__Bill7_1,s__Set),
inference(spm,[status(thm)],[c_0_31,c_0_9]) ).
cnf(c_0_34,negated_conjecture,
( X1 = s__UnionFn(s__NullSet,X2)
| ~ s__instance(esk158_3(X2,X1,s__NullSet),X3) ),
inference(spm,[status(thm)],[c_0_32,c_0_22]) ).
cnf(c_0_35,negated_conjecture,
s__instance(X1,s__Set),
inference(spm,[status(thm)],[c_0_33,c_0_28]) ).
cnf(c_0_36,negated_conjecture,
X1 = s__UnionFn(s__NullSet,X2),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,negated_conjecture,
X1 = X2,
inference(spm,[status(thm)],[c_0_36,c_0_36]) ).
cnf(c_0_38,negated_conjecture,
~ s__mother(X1,s__Jane7_1),
inference(spm,[status(thm)],[c_0_11,c_0_37]) ).
cnf(c_0_39,plain,
$false,
inference(sr,[status(thm)],[c_0_9,c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR081+4 : TPTP v8.1.2. Bugfixed v7.3.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n017.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 : Fri May 3 14:26:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 1.02/1.23 Running first-order model finding
% 1.02/1.23 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/tmp/tmp.WHwHhVNcLN/E---3.1_8016.p
% 22.72/4.35 # Version: 3.1.0
% 22.72/4.35 # Preprocessing class: FMLLSMSLSSSNFFN.
% 22.72/4.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.72/4.35 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 22.72/4.35 # Starting new_bool_3 with 300s (1) cores
% 22.72/4.35 # Starting new_bool_1 with 300s (1) cores
% 22.72/4.35 # Starting sh5l with 300s (1) cores
% 22.72/4.35 # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 8224 completed with status 0
% 22.72/4.35 # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 22.72/4.35 # Preprocessing class: FMLLSMSLSSSNFFN.
% 22.72/4.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.72/4.35 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 22.72/4.35 # No SInE strategy applied
% 22.72/4.35 # Search class: FGHSM-SMLM31-MFFFFFNN
% 22.72/4.35 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 22.72/4.35 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 22.72/4.35 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 22.72/4.35 # Starting new_bool_3 with 136s (1) cores
% 22.72/4.35 # Starting new_bool_1 with 136s (1) cores
% 22.72/4.35 # Starting sh5l with 136s (1) cores
% 22.72/4.35 # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 8232 completed with status 0
% 22.72/4.35 # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 22.72/4.35 # Preprocessing class: FMLLSMSLSSSNFFN.
% 22.72/4.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 22.72/4.35 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 22.72/4.35 # No SInE strategy applied
% 22.72/4.35 # Search class: FGHSM-SMLM31-MFFFFFNN
% 22.72/4.35 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 22.72/4.35 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 22.72/4.35 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 22.72/4.35 # Preprocessing time : 0.104 s
% 22.72/4.35 # Presaturation interreduction done
% 22.72/4.35
% 22.72/4.35 # Proof found!
% 22.72/4.35 # SZS status Theorem
% 22.72/4.35 # SZS output start CNFRefutation
% See solution above
% 22.72/4.35 # Parsed axioms : 7223
% 22.72/4.35 # Removed by relevancy pruning/SinE : 0
% 22.72/4.35 # Initial clauses : 8414
% 22.72/4.35 # Removed in clause preprocessing : 63
% 22.72/4.35 # Initial clauses in saturation : 8351
% 22.72/4.35 # Processed clauses : 17360
% 22.72/4.35 # ...of these trivial : 926
% 22.72/4.35 # ...subsumed : 250
% 22.72/4.35 # ...remaining for further processing : 16184
% 22.72/4.35 # Other redundant clauses eliminated : 35
% 22.72/4.35 # Clauses deleted for lack of memory : 0
% 22.72/4.35 # Backward-subsumed : 1115
% 22.72/4.35 # Backward-rewritten : 1411
% 22.72/4.35 # Generated clauses : 97800
% 22.72/4.35 # ...of the previous two non-redundant : 88163
% 22.72/4.35 # ...aggressively subsumed : 0
% 22.72/4.35 # Contextual simplify-reflections : 664
% 22.72/4.35 # Paramodulations : 97720
% 22.72/4.35 # Factorizations : 1
% 22.72/4.35 # NegExts : 0
% 22.72/4.35 # Equation resolutions : 50
% 22.72/4.35 # Disequality decompositions : 0
% 22.72/4.35 # Total rewrite steps : 12191
% 22.72/4.35 # ...of those cached : 7695
% 22.72/4.35 # Propositional unsat checks : 0
% 22.72/4.35 # Propositional check models : 0
% 22.72/4.35 # Propositional check unsatisfiable : 0
% 22.72/4.35 # Propositional clauses : 0
% 22.72/4.35 # Propositional clauses after purity: 0
% 22.72/4.35 # Propositional unsat core size : 0
% 22.72/4.35 # Propositional preprocessing time : 0.000
% 22.72/4.35 # Propositional encoding time : 0.000
% 22.72/4.35 # Propositional solver time : 0.000
% 22.72/4.35 # Success case prop preproc time : 0.000
% 22.72/4.35 # Success case prop encoding time : 0.000
% 22.72/4.35 # Success case prop solver time : 0.000
% 22.72/4.35 # Current number of processed clauses : 5466
% 22.72/4.35 # Positive orientable unit clauses : 3944
% 22.72/4.35 # Positive unorientable unit clauses: 1
% 22.72/4.35 # Negative unit clauses : 16
% 22.72/4.35 # Non-unit-clauses : 1505
% 22.72/4.35 # Current number of unprocessed clauses: 54547
% 22.72/4.35 # ...number of literals in the above : 106003
% 22.72/4.35 # Current number of archived formulas : 0
% 22.72/4.35 # Current number of archived clauses : 10710
% 22.72/4.35 # Clause-clause subsumption calls (NU) : 3042701
% 22.72/4.35 # Rec. Clause-clause subsumption calls : 840950
% 22.72/4.35 # Non-unit clause-clause subsumptions : 920
% 22.72/4.35 # Unit Clause-clause subsumption calls : 246502
% 22.72/4.35 # Rewrite failures with RHS unbound : 10069
% 22.72/4.35 # BW rewrite match attempts : 33384
% 22.72/4.35 # BW rewrite match successes : 11014
% 22.72/4.35 # Condensation attempts : 0
% 22.72/4.35 # Condensation successes : 0
% 22.72/4.35 # Termbank termtop insertions : 1124779
% 22.72/4.35 # Search garbage collected termcells : 89723
% 22.72/4.35
% 22.72/4.35 # -------------------------------------------------
% 22.72/4.35 # User time : 2.871 s
% 22.72/4.35 # System time : 0.118 s
% 22.72/4.35 # Total time : 2.990 s
% 22.72/4.35 # Maximum resident set size: 29756 pages
% 22.72/4.35
% 22.72/4.35 # -------------------------------------------------
% 22.72/4.35 # User time : 12.669 s
% 22.72/4.35 # System time : 0.290 s
% 22.72/4.35 # Total time : 12.958 s
% 22.72/4.35 # Maximum resident set size: 9164 pages
% 22.72/4.35 % E---3.1 exiting
%------------------------------------------------------------------------------