TSTP Solution File: NLP208+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NLP208+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 600s
% DateTime : Mon Jul 18 02:10:43 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 39 ( 8 unt; 0 def)
% Number of atoms : 223 ( 4 equ)
% Maximal formula atoms : 63 ( 5 avg)
% Number of connectives : 233 ( 49 ~; 40 |; 126 &)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 51 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 44 ( 42 usr; 1 prp; 0-4 aty)
% Number of functors : 14 ( 14 usr; 11 con; 0-2 aty)
% Number of variables : 105 ( 2 sgn 51 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
~ ? [X1] :
( actual_world(X1)
& ? [X2,X3,X4,X5,X6,X7,X8,X9,X10,X11] :
( of(X1,X3,X2)
& man(X1,X2)
& jules_forename(X1,X3)
& forename(X1,X3)
& frontseat(X1,X6)
& chevy(X1,X4)
& white(X1,X4)
& dirty(X1,X4)
& old(X1,X4)
& of(X1,X5,X6)
& city(X1,X6)
& hollywood_placename(X1,X5)
& placename(X1,X5)
& street(X1,X6)
& lonely(X1,X6)
& event(X1,X7)
& agent(X1,X7,X4)
& present(X1,X7)
& barrel(X1,X7)
& down(X1,X7,X6)
& in(X1,X7,X6)
& ! [X12] :
( member(X1,X12,X8)
=> ? [X13,X14] :
( state(X1,X13)
& be(X1,X13,X12,X14)
& in(X1,X14,X6) ) )
& two(X1,X8)
& group(X1,X8)
& ! [X15] :
( member(X1,X15,X8)
=> ( fellow(X1,X15)
& young(X1,X15) ) )
& ! [X16] :
( member(X1,X16,X9)
=> ! [X17] :
( member(X1,X17,X8)
=> ? [X18] :
( event(X1,X18)
& agent(X1,X18,X17)
& patient(X1,X18,X16)
& present(X1,X18)
& nonreflexive(X1,X18)
& wear(X1,X18) ) ) )
& group(X1,X9)
& ! [X19] :
( member(X1,X19,X9)
=> ( coat(X1,X19)
& black(X1,X19)
& cheap(X1,X19) ) )
& wheel(X1,X11)
& state(X1,X10)
& be(X1,X10,X2,X11)
& behind(X1,X11,X11) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax63,axiom,
! [X1,X2] :
( unisex(X1,X2)
=> ~ male(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax63) ).
fof(ax24,axiom,
! [X1,X2] :
( man(X1,X2)
=> male(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax24) ).
fof(ax71,axiom,
! [X1,X2,X3,X4] :
( be(X1,X2,X3,X4)
=> X3 = X4 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax71) ).
fof(ax47,axiom,
! [X1,X2] :
( device(X1,X2)
=> instrumentality(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax47) ).
fof(ax48,axiom,
! [X1,X2] :
( wheel(X1,X2)
=> device(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax48) ).
fof(ax38,axiom,
! [X1,X2] :
( object(X1,X2)
=> unisex(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax38) ).
fof(ax45,axiom,
! [X1,X2] :
( artifact(X1,X2)
=> object(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax45) ).
fof(ax46,axiom,
! [X1,X2] :
( instrumentality(X1,X2)
=> artifact(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax46) ).
fof(c_0_9,negated_conjecture,
~ ~ ? [X1] :
( actual_world(X1)
& ? [X2,X3,X4,X5,X6,X7,X8,X9,X10,X11] :
( of(X1,X3,X2)
& man(X1,X2)
& jules_forename(X1,X3)
& forename(X1,X3)
& frontseat(X1,X6)
& chevy(X1,X4)
& white(X1,X4)
& dirty(X1,X4)
& old(X1,X4)
& of(X1,X5,X6)
& city(X1,X6)
& hollywood_placename(X1,X5)
& placename(X1,X5)
& street(X1,X6)
& lonely(X1,X6)
& event(X1,X7)
& agent(X1,X7,X4)
& present(X1,X7)
& barrel(X1,X7)
& down(X1,X7,X6)
& in(X1,X7,X6)
& ! [X12] :
( member(X1,X12,X8)
=> ? [X13,X14] :
( state(X1,X13)
& be(X1,X13,X12,X14)
& in(X1,X14,X6) ) )
& two(X1,X8)
& group(X1,X8)
& ! [X15] :
( member(X1,X15,X8)
=> ( fellow(X1,X15)
& young(X1,X15) ) )
& ! [X16] :
( member(X1,X16,X9)
=> ! [X17] :
( member(X1,X17,X8)
=> ? [X18] :
( event(X1,X18)
& agent(X1,X18,X17)
& patient(X1,X18,X16)
& present(X1,X18)
& nonreflexive(X1,X18)
& wear(X1,X18) ) ) )
& group(X1,X9)
& ! [X19] :
( member(X1,X19,X9)
=> ( coat(X1,X19)
& black(X1,X19)
& cheap(X1,X19) ) )
& wheel(X1,X11)
& state(X1,X10)
& be(X1,X10,X2,X11)
& behind(X1,X11,X11) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_10,plain,
! [X3,X4] :
( ~ unisex(X3,X4)
| ~ male(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax63])])]) ).
fof(c_0_11,plain,
! [X3,X4] :
( ~ man(X3,X4)
| male(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
fof(c_0_12,plain,
! [X5,X6,X7,X8] :
( ~ be(X5,X6,X7,X8)
| X7 = X8 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax71])]) ).
fof(c_0_13,negated_conjecture,
! [X31,X34,X35,X36,X38] :
( actual_world(esk4_0)
& of(esk4_0,esk6_0,esk5_0)
& man(esk4_0,esk5_0)
& jules_forename(esk4_0,esk6_0)
& forename(esk4_0,esk6_0)
& frontseat(esk4_0,esk9_0)
& chevy(esk4_0,esk7_0)
& white(esk4_0,esk7_0)
& dirty(esk4_0,esk7_0)
& old(esk4_0,esk7_0)
& of(esk4_0,esk8_0,esk9_0)
& city(esk4_0,esk9_0)
& hollywood_placename(esk4_0,esk8_0)
& placename(esk4_0,esk8_0)
& street(esk4_0,esk9_0)
& lonely(esk4_0,esk9_0)
& event(esk4_0,esk10_0)
& agent(esk4_0,esk10_0,esk7_0)
& present(esk4_0,esk10_0)
& barrel(esk4_0,esk10_0)
& down(esk4_0,esk10_0,esk9_0)
& in(esk4_0,esk10_0,esk9_0)
& ( state(esk4_0,esk15_1(X31))
| ~ member(esk4_0,X31,esk11_0) )
& ( be(esk4_0,esk15_1(X31),X31,esk16_1(X31))
| ~ member(esk4_0,X31,esk11_0) )
& ( in(esk4_0,esk16_1(X31),esk9_0)
| ~ member(esk4_0,X31,esk11_0) )
& two(esk4_0,esk11_0)
& group(esk4_0,esk11_0)
& ( fellow(esk4_0,X34)
| ~ member(esk4_0,X34,esk11_0) )
& ( young(esk4_0,X34)
| ~ member(esk4_0,X34,esk11_0) )
& ( event(esk4_0,esk17_2(X35,X36))
| ~ member(esk4_0,X36,esk11_0)
| ~ member(esk4_0,X35,esk12_0) )
& ( agent(esk4_0,esk17_2(X35,X36),X36)
| ~ member(esk4_0,X36,esk11_0)
| ~ member(esk4_0,X35,esk12_0) )
& ( patient(esk4_0,esk17_2(X35,X36),X35)
| ~ member(esk4_0,X36,esk11_0)
| ~ member(esk4_0,X35,esk12_0) )
& ( present(esk4_0,esk17_2(X35,X36))
| ~ member(esk4_0,X36,esk11_0)
| ~ member(esk4_0,X35,esk12_0) )
& ( nonreflexive(esk4_0,esk17_2(X35,X36))
| ~ member(esk4_0,X36,esk11_0)
| ~ member(esk4_0,X35,esk12_0) )
& ( wear(esk4_0,esk17_2(X35,X36))
| ~ member(esk4_0,X36,esk11_0)
| ~ member(esk4_0,X35,esk12_0) )
& group(esk4_0,esk12_0)
& ( coat(esk4_0,X38)
| ~ member(esk4_0,X38,esk12_0) )
& ( black(esk4_0,X38)
| ~ member(esk4_0,X38,esk12_0) )
& ( cheap(esk4_0,X38)
| ~ member(esk4_0,X38,esk12_0) )
& wheel(esk4_0,esk14_0)
& state(esk4_0,esk13_0)
& be(esk4_0,esk13_0,esk5_0,esk14_0)
& behind(esk4_0,esk14_0,esk14_0) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])])]) ).
fof(c_0_14,plain,
! [X3,X4] :
( ~ device(X3,X4)
| instrumentality(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax47])]) ).
fof(c_0_15,plain,
! [X3,X4] :
( ~ wheel(X3,X4)
| device(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax48])]) ).
cnf(c_0_16,plain,
( ~ male(X1,X2)
| ~ unisex(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( male(X1,X2)
| ~ man(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_18,plain,
! [X3,X4] :
( ~ object(X3,X4)
| unisex(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax38])]) ).
cnf(c_0_19,plain,
( X1 = X2
| ~ be(X3,X4,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
be(esk4_0,esk13_0,esk5_0,esk14_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_21,plain,
! [X3,X4] :
( ~ artifact(X3,X4)
| object(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])]) ).
fof(c_0_22,plain,
! [X3,X4] :
( ~ instrumentality(X3,X4)
| artifact(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax46])]) ).
cnf(c_0_23,plain,
( instrumentality(X1,X2)
| ~ device(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
( device(X1,X2)
| ~ wheel(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,plain,
( ~ man(X1,X2)
| ~ unisex(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_26,plain,
( unisex(X1,X2)
| ~ object(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,negated_conjecture,
man(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_28,negated_conjecture,
esk5_0 = esk14_0,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,plain,
( object(X1,X2)
| ~ artifact(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
( artifact(X1,X2)
| ~ instrumentality(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
( instrumentality(X1,X2)
| ~ wheel(X1,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_32,negated_conjecture,
wheel(esk4_0,esk14_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_33,plain,
( ~ man(X1,X2)
| ~ object(X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,negated_conjecture,
man(esk4_0,esk14_0),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
( object(X1,X2)
| ~ instrumentality(X1,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
instrumentality(esk4_0,esk14_0),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
~ object(esk4_0,esk14_0),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NLP208+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n017.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 : 600
% 0.12/0.33 % DateTime : Fri Jul 1 05:56:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40 # Preprocessing time : 0.021 s
% 0.21/1.40
% 0.21/1.40 # Failure: Out of unprocessed clauses!
% 0.21/1.40 # OLD status GaveUp
% 0.21/1.40 # Parsed axioms : 72
% 0.21/1.40 # Removed by relevancy pruning/SinE : 31
% 0.21/1.40 # Initial clauses : 89
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 89
% 0.21/1.40 # Processed clauses : 140
% 0.21/1.40 # ...of these trivial : 0
% 0.21/1.40 # ...subsumed : 1
% 0.21/1.40 # ...remaining for further processing : 139
% 0.21/1.40 # Other redundant clauses eliminated : 1
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 4
% 0.21/1.40 # Backward-rewritten : 5
% 0.21/1.40 # Generated clauses : 53
% 0.21/1.40 # ...of the previous two non-trivial : 53
% 0.21/1.40 # Contextual simplify-reflections : 1
% 0.21/1.40 # Paramodulations : 52
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 1
% 0.21/1.40 # Current number of processed clauses : 129
% 0.21/1.40 # Positive orientable unit clauses : 38
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 5
% 0.21/1.40 # Non-unit-clauses : 86
% 0.21/1.40 # Current number of unprocessed clauses: 0
% 0.21/1.40 # ...number of literals in the above : 0
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 9
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 2381
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 1708
% 0.21/1.40 # Non-unit clause-clause subsumptions : 6
% 0.21/1.40 # Unit Clause-clause subsumption calls : 27
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 2
% 0.21/1.40 # BW rewrite match successes : 2
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 5545
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.026 s
% 0.21/1.40 # System time : 0.002 s
% 0.21/1.40 # Total time : 0.028 s
% 0.21/1.40 # Maximum resident set size: 3560 pages
% 0.21/1.40 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.21/1.40 # Preprocessing time : 0.019 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 39
% 0.21/1.40 # Proof object clause steps : 20
% 0.21/1.40 # Proof object formula steps : 19
% 0.21/1.40 # Proof object conjectures : 11
% 0.21/1.40 # Proof object clause conjectures : 8
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 11
% 0.21/1.40 # Proof object initial formulas used : 9
% 0.21/1.40 # Proof object generating inferences : 8
% 0.21/1.40 # Proof object simplifying inferences : 2
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 72
% 0.21/1.40 # Removed by relevancy pruning/SinE : 0
% 0.21/1.40 # Initial clauses : 120
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 120
% 0.21/1.40 # Processed clauses : 224
% 0.21/1.40 # ...of these trivial : 1
% 0.21/1.40 # ...subsumed : 8
% 0.21/1.40 # ...remaining for further processing : 215
% 0.21/1.40 # Other redundant clauses eliminated : 1
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 0
% 0.21/1.40 # Backward-rewritten : 4
% 0.21/1.40 # Generated clauses : 118
% 0.21/1.40 # ...of the previous two non-trivial : 117
% 0.21/1.40 # Contextual simplify-reflections : 0
% 0.21/1.40 # Paramodulations : 117
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 1
% 0.21/1.40 # Current number of processed clauses : 210
% 0.21/1.40 # Positive orientable unit clauses : 36
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 25
% 0.21/1.40 # Non-unit-clauses : 149
% 0.21/1.40 # Current number of unprocessed clauses: 11
% 0.21/1.40 # ...number of literals in the above : 29
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 4
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 8603
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 7059
% 0.21/1.40 # Non-unit clause-clause subsumptions : 6
% 0.21/1.40 # Unit Clause-clause subsumption calls : 732
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 2
% 0.21/1.40 # BW rewrite match successes : 2
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 7489
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.024 s
% 0.21/1.40 # System time : 0.004 s
% 0.21/1.40 # Total time : 0.028 s
% 0.21/1.40 # Maximum resident set size: 3720 pages
%------------------------------------------------------------------------------