TSTP Solution File: CSR147+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR147+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:34:42 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 23 ( 19 unt; 0 def)
% Number of atoms : 40 ( 2 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 35 ( 18 ~; 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_has_seen_more,axiom,
~ s__has_seen_more(geoff,jim),
file('/export/starexec/sandbox2/tmp/tmp.njGInGz5nS/E---3.1_31466.p',jim_has_seen_more) ).
fof(jim_is_experienced,conjecture,
s__more_experienced(jim,geoff),
file('/export/starexec/sandbox2/tmp/tmp.njGInGz5nS/E---3.1_31466.p',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/tmp/tmp.njGInGz5nS/E---3.1_31466.p',experience) ).
fof(geoff_and_jim,axiom,
geoff = s__siblingFn(jim),
file('/export/starexec/sandbox2/tmp/tmp.njGInGz5nS/E---3.1_31466.p',geoff_and_jim) ).
fof(jim_human,axiom,
s__Human(jim),
file('/export/starexec/sandbox2/tmp/tmp.njGInGz5nS/E---3.1_31466.p',jim_human) ).
fof(greater_54_48,axiom,
greater(n54,n48),
file('/export/starexec/sandbox2/tmp/tmp.njGInGz5nS/E---3.1_31466.p',greater_54_48) ).
fof(geoff_48,axiom,
s__age(geoff,n48),
file('/export/starexec/sandbox2/tmp/tmp.njGInGz5nS/E---3.1_31466.p',geoff_48) ).
fof(jim_54,axiom,
s__age(jim,n54),
file('/export/starexec/sandbox2/tmp/tmp.njGInGz5nS/E---3.1_31466.p',jim_54) ).
fof(c_0_8,plain,
~ s__has_seen_more(geoff,jim),
inference(fof_simplification,[status(thm)],[jim_has_seen_more]) ).
fof(c_0_9,negated_conjecture,
~ s__more_experienced(jim,geoff),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[jim_is_experienced])]) ).
fof(c_0_10,plain,
! [X7,X8,X9] :
( ~ s__Human(X7)
| ~ s__age(X7,X8)
| ~ s__age(s__siblingFn(X7),X9)
| ~ greater(X8,X9)
| s__more_experienced(X7,s__siblingFn(X7))
| s__has_seen_more(s__siblingFn(X7),X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[experience])])]) ).
fof(c_0_11,plain,
~ s__has_seen_more(geoff,jim),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
fof(c_0_12,negated_conjecture,
~ s__more_experienced(jim,geoff),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( s__more_experienced(X1,s__siblingFn(X1))
| s__has_seen_more(s__siblingFn(X1),X1)
| ~ s__Human(X1)
| ~ s__age(X1,X2)
| ~ s__age(s__siblingFn(X1),X3)
| ~ greater(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
geoff = s__siblingFn(jim),
inference(split_conjunct,[status(thm)],[geoff_and_jim]) ).
cnf(c_0_15,plain,
s__Human(jim),
inference(split_conjunct,[status(thm)],[jim_human]) ).
cnf(c_0_16,plain,
~ s__has_seen_more(geoff,jim),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
~ s__more_experienced(jim,geoff),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,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_13,c_0_14]),c_0_15])]),c_0_16]),c_0_17]) ).
cnf(c_0_19,plain,
greater(n54,n48),
inference(split_conjunct,[status(thm)],[greater_54_48]) ).
cnf(c_0_20,plain,
s__age(geoff,n48),
inference(split_conjunct,[status(thm)],[geoff_48]) ).
cnf(c_0_21,plain,
s__age(jim,n54),
inference(split_conjunct,[status(thm)],[jim_54]) ).
cnf(c_0_22,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : CSR147+1 : TPTP v8.1.2. Released v4.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n002.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 14:36:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.njGInGz5nS/E---3.1_31466.p
% 0.21/0.50 # Version: 3.1.0
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # sh5l with pid 31548 completed with status 0
% 0.21/0.50 # Result found by sh5l
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.50 # Search class: FGUSF-FFSM11-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50 # SAT001_MinMin_p005000_rr_RG with pid 31556 completed with status 0
% 0.21/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.50 # Search class: FGUSF-FFSM11-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 14
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 14
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 14
% 0.21/0.50 # Processed clauses : 31
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 0
% 0.21/0.50 # ...remaining for further processing : 31
% 0.21/0.50 # Other redundant clauses eliminated : 1
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 0
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 10
% 0.21/0.50 # ...of the previous two non-redundant : 5
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 1
% 0.21/0.50 # Paramodulations : 9
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 1
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 11
% 0.21/0.50 # ...of those cached : 6
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 16
% 0.21/0.50 # Positive orientable unit clauses : 9
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 2
% 0.21/0.50 # Non-unit-clauses : 5
% 0.21/0.50 # Current number of unprocessed clauses: 2
% 0.21/0.50 # ...number of literals in the above : 12
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 14
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 12
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 4
% 0.21/0.50 # Non-unit clause-clause subsumptions : 1
% 0.21/0.50 # Unit Clause-clause subsumption calls : 2
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 0
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 733
% 0.21/0.50 # Search garbage collected termcells : 88
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.002 s
% 0.21/0.50 # System time : 0.003 s
% 0.21/0.50 # Total time : 0.006 s
% 0.21/0.50 # Maximum resident set size: 1740 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.004 s
% 0.21/0.50 # System time : 0.005 s
% 0.21/0.50 # Total time : 0.009 s
% 0.21/0.50 # Maximum resident set size: 1696 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------