TSTP Solution File: CSR147+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR147+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n025.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 : Fri Jul 15 03:03:44 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 22 ( 18 unt; 0 def)
% Number of atoms : 39 ( 2 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 34 ( 17 ~; 13 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 11 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(jim_is_experienced,conjecture,
s__more_experienced(jim,geoff),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',jim_is_experienced) ).
fof(experience,axiom,
! [X2,X3,X4] :
( s__Human(X2)
=> ( ( s__age(X2,X3)
& s__age(s__siblingFn(X2),X4)
& greater(X3,X4) )
=> ( s__more_experienced(X2,s__siblingFn(X2))
| s__has_seen_more(s__siblingFn(X2),X2) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',experience) ).
fof(jim_has_seen_more,axiom,
~ s__has_seen_more(geoff,jim),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',jim_has_seen_more) ).
fof(geoff_and_jim,axiom,
geoff = s__siblingFn(jim),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',geoff_and_jim) ).
fof(jim_human,axiom,
s__Human(jim),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',jim_human) ).
fof(greater_54_48,axiom,
greater(n54,n48),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',greater_54_48) ).
fof(geoff_48,axiom,
s__age(geoff,n48),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',geoff_48) ).
fof(jim_54,axiom,
s__age(jim,n54),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',jim_54) ).
fof(c_0_8,negated_conjecture,
~ s__more_experienced(jim,geoff),
inference(assume_negation,[status(cth)],[jim_is_experienced]) ).
fof(c_0_9,plain,
! [X5,X6,X7] :
( ~ s__Human(X5)
| ~ s__age(X5,X6)
| ~ s__age(s__siblingFn(X5),X7)
| ~ greater(X6,X7)
| s__more_experienced(X5,s__siblingFn(X5))
| s__has_seen_more(s__siblingFn(X5),X5) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[experience])])])]) ).
fof(c_0_10,plain,
~ s__has_seen_more(geoff,jim),
inference(fof_simplification,[status(thm)],[jim_has_seen_more]) ).
fof(c_0_11,negated_conjecture,
~ s__more_experienced(jim,geoff),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( s__has_seen_more(s__siblingFn(X1),X1)
| s__more_experienced(X1,s__siblingFn(X1))
| ~ greater(X2,X3)
| ~ s__age(s__siblingFn(X1),X3)
| ~ s__age(X1,X2)
| ~ s__Human(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
geoff = s__siblingFn(jim),
inference(split_conjunct,[status(thm)],[geoff_and_jim]) ).
cnf(c_0_14,plain,
s__Human(jim),
inference(split_conjunct,[status(thm)],[jim_human]) ).
cnf(c_0_15,plain,
~ s__has_seen_more(geoff,jim),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
~ s__more_experienced(jim,geoff),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( ~ greater(X1,X2)
| ~ s__age(geoff,X2)
| ~ s__age(jim,X1) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),c_0_15]),c_0_16]) ).
cnf(c_0_18,plain,
greater(n54,n48),
inference(split_conjunct,[status(thm)],[greater_54_48]) ).
cnf(c_0_19,plain,
s__age(geoff,n48),
inference(split_conjunct,[status(thm)],[geoff_48]) ).
cnf(c_0_20,plain,
s__age(jim,n54),
inference(split_conjunct,[status(thm)],[jim_54]) ).
cnf(c_0_21,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR147+1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n025.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 : 600
% 0.13/0.34 % DateTime : Fri Jun 10 07:06:51 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.014 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 22
% 0.23/1.41 # Proof object clause steps : 10
% 0.23/1.41 # Proof object formula steps : 12
% 0.23/1.41 # Proof object conjectures : 4
% 0.23/1.41 # Proof object clause conjectures : 1
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 8
% 0.23/1.41 # Proof object initial formulas used : 8
% 0.23/1.41 # Proof object generating inferences : 2
% 0.23/1.41 # Proof object simplifying inferences : 7
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 14
% 0.23/1.41 # Removed by relevancy pruning/SinE : 2
% 0.23/1.41 # Initial clauses : 12
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 12
% 0.23/1.41 # Processed clauses : 13
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 0
% 0.23/1.41 # ...remaining for further processing : 13
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 0
% 0.23/1.41 # Generated clauses : 5
% 0.23/1.41 # ...of the previous two non-trivial : 3
% 0.23/1.41 # Contextual simplify-reflections : 0
% 0.23/1.41 # Paramodulations : 4
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 1
% 0.23/1.41 # Current number of processed clauses : 13
% 0.23/1.41 # Positive orientable unit clauses : 7
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 2
% 0.23/1.41 # Non-unit-clauses : 4
% 0.23/1.41 # Current number of unprocessed clauses: 2
% 0.23/1.41 # ...number of literals in the above : 6
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 0
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 2
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 2
% 0.23/1.41 # Non-unit clause-clause subsumptions : 0
% 0.23/1.41 # Unit Clause-clause subsumption calls : 1
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 0
% 0.23/1.41 # BW rewrite match successes : 0
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 536
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.012 s
% 0.23/1.41 # System time : 0.002 s
% 0.23/1.41 # Total time : 0.014 s
% 0.23/1.41 # Maximum resident set size: 2776 pages
%------------------------------------------------------------------------------