TSTP Solution File: CSR066+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR066+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.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:02:05 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 7 unt; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 43 ( 19 ~; 14 |; 4 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-4 aty)
% Number of variables : 27 ( 0 sgn 15 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query66,conjecture,
? [X13] :
( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))
=> ( tptp_8_271(X13,c_theprototypicalshavingrazor_manual)
& tptpcol_16_25972(X13) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query66) ).
fof(just32,axiom,
! [X13] :
( isa(X13,c_tptpcol_16_25972)
=> tptpcol_16_25972(X13) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just32) ).
fof(just9,axiom,
! [X1] :
( shavingrazor_manual(X1)
=> tptp_8_271(f_relationexistsallfn(X1,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just9) ).
fof(just4,axiom,
! [X1,X2,X3,X4] :
( ( isa(X1,X2)
& relationexistsall(X3,X4,X2) )
=> isa(f_relationexistsallfn(X1,X3,X4,X2),X4) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just4) ).
fof(just31,axiom,
! [X13] :
( shavingrazor_manual(X13)
=> isa(X13,c_shavingrazor_manual) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just31) ).
fof(just11,axiom,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just11) ).
fof(just10,axiom,
relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just10) ).
fof(c_0_7,negated_conjecture,
~ ? [X13] :
( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))
=> ( tptp_8_271(X13,c_theprototypicalshavingrazor_manual)
& tptpcol_16_25972(X13) ) ),
inference(assume_negation,[status(cth)],[query66]) ).
fof(c_0_8,negated_conjecture,
! [X14] :
( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))
& ( ~ tptp_8_271(X14,c_theprototypicalshavingrazor_manual)
| ~ tptpcol_16_25972(X14) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_9,plain,
! [X14] :
( ~ isa(X14,c_tptpcol_16_25972)
| tptpcol_16_25972(X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just32])]) ).
cnf(c_0_10,negated_conjecture,
( ~ tptpcol_16_25972(X1)
| ~ tptp_8_271(X1,c_theprototypicalshavingrazor_manual) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( tptpcol_16_25972(X1)
| ~ isa(X1,c_tptpcol_16_25972) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X2] :
( ~ shavingrazor_manual(X2)
| tptp_8_271(f_relationexistsallfn(X2,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just9])]) ).
fof(c_0_13,plain,
! [X5,X6,X7,X8] :
( ~ isa(X5,X6)
| ~ relationexistsall(X7,X8,X6)
| isa(f_relationexistsallfn(X5,X7,X8,X6),X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just4])]) ).
fof(c_0_14,plain,
! [X14] :
( ~ shavingrazor_manual(X14)
| isa(X14,c_shavingrazor_manual) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just31])]) ).
cnf(c_0_15,negated_conjecture,
( ~ tptp_8_271(X1,c_theprototypicalshavingrazor_manual)
| ~ isa(X1,c_tptpcol_16_25972) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( tptp_8_271(f_relationexistsallfn(X1,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X1)
| ~ shavingrazor_manual(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
inference(split_conjunct,[status(thm)],[just11]) ).
cnf(c_0_18,plain,
( isa(f_relationexistsallfn(X1,X2,X3,X4),X3)
| ~ relationexistsall(X2,X3,X4)
| ~ isa(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
inference(split_conjunct,[status(thm)],[just10]) ).
cnf(c_0_20,plain,
( isa(X1,c_shavingrazor_manual)
| ~ shavingrazor_manual(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
~ isa(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_tptpcol_16_25972),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_22,plain,
( isa(f_relationexistsallfn(X1,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_tptpcol_16_25972)
| ~ isa(X1,c_shavingrazor_manual) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
isa(c_theprototypicalshavingrazor_manual,c_shavingrazor_manual),
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR066+1 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n018.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 01:35:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.009 s
% 0.24/1.42
% 0.24/1.42 # Failure: Out of unprocessed clauses!
% 0.24/1.42 # OLD status GaveUp
% 0.24/1.42 # Parsed axioms : 74
% 0.24/1.42 # Removed by relevancy pruning/SinE : 50
% 0.24/1.42 # Initial clauses : 25
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 25
% 0.24/1.42 # Processed clauses : 57
% 0.24/1.42 # ...of these trivial : 3
% 0.24/1.42 # ...subsumed : 3
% 0.24/1.42 # ...remaining for further processing : 51
% 0.24/1.42 # Other redundant clauses eliminated : 0
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 0
% 0.24/1.42 # Generated clauses : 88
% 0.24/1.42 # ...of the previous two non-trivial : 32
% 0.24/1.42 # Contextual simplify-reflections : 0
% 0.24/1.42 # Paramodulations : 88
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 51
% 0.24/1.42 # Positive orientable unit clauses : 31
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 0
% 0.24/1.42 # Non-unit-clauses : 20
% 0.24/1.42 # Current number of unprocessed clauses: 0
% 0.24/1.42 # ...number of literals in the above : 0
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 0
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 51
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 35
% 0.24/1.42 # Non-unit clause-clause subsumptions : 3
% 0.24/1.42 # Unit Clause-clause subsumption calls : 0
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 0
% 0.24/1.42 # BW rewrite match successes : 0
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 2187
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.009 s
% 0.24/1.42 # System time : 0.001 s
% 0.24/1.42 # Total time : 0.010 s
% 0.24/1.42 # Maximum resident set size: 3092 pages
% 0.24/1.42 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.24/1.42 # Preprocessing time : 0.017 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 25
% 0.24/1.42 # Proof object clause steps : 12
% 0.24/1.42 # Proof object formula steps : 13
% 0.24/1.42 # Proof object conjectures : 7
% 0.24/1.42 # Proof object clause conjectures : 4
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 7
% 0.24/1.42 # Proof object initial formulas used : 7
% 0.24/1.42 # Proof object generating inferences : 5
% 0.24/1.42 # Proof object simplifying inferences : 4
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 74
% 0.24/1.42 # Removed by relevancy pruning/SinE : 0
% 0.24/1.42 # Initial clauses : 75
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 75
% 0.24/1.42 # Processed clauses : 135
% 0.24/1.42 # ...of these trivial : 5
% 0.24/1.42 # ...subsumed : 11
% 0.24/1.42 # ...remaining for further processing : 119
% 0.24/1.42 # Other redundant clauses eliminated : 0
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 0
% 0.24/1.42 # Generated clauses : 145
% 0.24/1.42 # ...of the previous two non-trivial : 65
% 0.24/1.42 # Contextual simplify-reflections : 0
% 0.24/1.42 # Paramodulations : 145
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 119
% 0.24/1.42 # Positive orientable unit clauses : 61
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 1
% 0.24/1.42 # Non-unit-clauses : 57
% 0.24/1.42 # Current number of unprocessed clauses: 5
% 0.24/1.42 # ...number of literals in the above : 9
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 0
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 634
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 548
% 0.24/1.42 # Non-unit clause-clause subsumptions : 11
% 0.24/1.42 # Unit Clause-clause subsumption calls : 152
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 0
% 0.24/1.42 # BW rewrite match successes : 0
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 4959
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.019 s
% 0.24/1.42 # System time : 0.002 s
% 0.24/1.42 # Total time : 0.021 s
% 0.24/1.42 # Maximum resident set size: 3292 pages
%------------------------------------------------------------------------------