%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR066+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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:06 EDT 2022
% Result : Theorem 0.85s 2.03s
% Output : CNFRefutation 0.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 8 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 41 ( 18 ~; 13 |; 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 : 26 ( 0 sgn 15 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query166,conjecture,
? [X15] :
( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))
=> ( tptp_8_271(X15,c_theprototypicalshavingrazor_manual)
& tptpcol_16_25972(X15) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query166) ).
fof(ax2_3627,axiom,
! [X7] :
( shavingrazor_manual(X7)
=> tptp_8_271(f_relationexistsallfn(X7,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X7) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_3627) ).
fof(ax2_195,axiom,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_195) ).
fof(ax2_5089,axiom,
! [X15] :
( isa(X15,c_tptpcol_16_25972)
=> tptpcol_16_25972(X15) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_5089) ).
fof(ax2_453,axiom,
! [X7,X8,X9,X10] :
( ( isa(X7,X8)
& relationexistsall(X9,X10,X8) )
=> isa(f_relationexistsallfn(X7,X9,X10,X8),X10) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_453) ).
fof(ax2_7743,axiom,
! [X15] :
( shavingrazor_manual(X15)
=> isa(X15,c_shavingrazor_manual) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_7743) ).
fof(ax2_3628,axiom,
relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_3628) ).
fof(c_0_7,negated_conjecture,
~ ? [X15] :
( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))
=> ( tptp_8_271(X15,c_theprototypicalshavingrazor_manual)
& tptpcol_16_25972(X15) ) ),
inference(assume_negation,[status(cth)],[query166]) ).
fof(c_0_8,negated_conjecture,
! [X16] :
( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))
& ( ~ tptp_8_271(X16,c_theprototypicalshavingrazor_manual)
| ~ tptpcol_16_25972(X16) ) ),
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,
! [X8] :
( ~ shavingrazor_manual(X8)
| tptp_8_271(f_relationexistsallfn(X8,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_3627])]) ).
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,
( 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_9]) ).
cnf(c_0_12,plain,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
inference(split_conjunct,[status(thm)],[ax2_195]) ).
fof(c_0_13,plain,
! [X16] :
( ~ isa(X16,c_tptpcol_16_25972)
| tptpcol_16_25972(X16) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_5089])]) ).
fof(c_0_14,plain,
! [X11,X12,X13,X14] :
( ~ isa(X11,X12)
| ~ relationexistsall(X13,X14,X12)
| isa(f_relationexistsallfn(X11,X13,X14,X12),X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_453])]) ).
fof(c_0_15,plain,
! [X16] :
( ~ shavingrazor_manual(X16)
| isa(X16,c_shavingrazor_manual) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_7743])]) ).
cnf(c_0_16,negated_conjecture,
~ tptpcol_16_25972(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_17,plain,
( tptpcol_16_25972(X1)
| ~ isa(X1,c_tptpcol_16_25972) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
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_14]) ).
cnf(c_0_19,plain,
relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
inference(split_conjunct,[status(thm)],[ax2_3628]) ).
cnf(c_0_20,plain,
( isa(X1,c_shavingrazor_manual)
| ~ shavingrazor_manual(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
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(spm,[status(thm)],[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_12]) ).
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.04/0.13 % Problem : CSR066+3 : TPTP v8.1.0. Released v3.4.0.
% 0.04/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jun 10 07:02:39 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.85/2.03 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.85/2.03 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.85/2.03 # Preprocessing time : 0.151 s
% 0.85/2.03
% 0.85/2.03 # Proof found!
% 0.85/2.03 # SZS status Theorem
% 0.85/2.03 # SZS output start CNFRefutation
% See solution above
% 0.85/2.03 # Proof object total steps : 25
% 0.85/2.03 # Proof object clause steps : 12
% 0.85/2.03 # Proof object formula steps : 13
% 0.85/2.03 # Proof object conjectures : 7
% 0.85/2.03 # Proof object clause conjectures : 4
% 0.85/2.03 # Proof object formula conjectures : 3
% 0.85/2.03 # Proof object initial clauses used : 7
% 0.85/2.03 # Proof object initial formulas used : 7
% 0.85/2.03 # Proof object generating inferences : 5
% 0.85/2.03 # Proof object simplifying inferences : 4
% 0.85/2.03 # Training examples: 0 positive, 0 negative
% 0.85/2.03 # Parsed axioms : 8006
% 0.85/2.03 # Removed by relevancy pruning/SinE : 7949
% 0.85/2.03 # Initial clauses : 58
% 0.85/2.03 # Removed in clause preprocessing : 0
% 0.85/2.03 # Initial clauses in saturation : 58
% 0.85/2.03 # Processed clauses : 69
% 0.85/2.03 # ...of these trivial : 3
% 0.85/2.03 # ...subsumed : 12
% 0.85/2.03 # ...remaining for further processing : 54
% 0.85/2.03 # Other redundant clauses eliminated : 0
% 0.85/2.03 # Clauses deleted for lack of memory : 0
% 0.85/2.03 # Backward-subsumed : 0
% 0.85/2.03 # Backward-rewritten : 0
% 0.85/2.03 # Generated clauses : 23
% 0.85/2.03 # ...of the previous two non-trivial : 12
% 0.85/2.03 # Contextual simplify-reflections : 0
% 0.85/2.03 # Paramodulations : 23
% 0.85/2.03 # Factorizations : 0
% 0.85/2.03 # Equation resolutions : 0
% 0.85/2.03 # Current number of processed clauses : 54
% 0.85/2.03 # Positive orientable unit clauses : 28
% 0.85/2.03 # Positive unorientable unit clauses: 0
% 0.85/2.03 # Negative unit clauses : 2
% 0.85/2.03 # Non-unit-clauses : 24
% 0.85/2.03 # Current number of unprocessed clauses: 1
% 0.85/2.03 # ...number of literals in the above : 3
% 0.85/2.03 # Current number of archived formulas : 0
% 0.85/2.03 # Current number of archived clauses : 0
% 0.85/2.03 # Clause-clause subsumption calls (NU) : 144
% 0.85/2.03 # Rec. Clause-clause subsumption calls : 114
% 0.85/2.03 # Non-unit clause-clause subsumptions : 12
% 0.85/2.03 # Unit Clause-clause subsumption calls : 14
% 0.85/2.03 # Rewrite failures with RHS unbound : 0
% 0.85/2.03 # BW rewrite match attempts : 0
% 0.85/2.03 # BW rewrite match successes : 0
% 0.85/2.03 # Condensation attempts : 0
% 0.85/2.03 # Condensation successes : 0
% 0.85/2.03 # Termbank termtop insertions : 53475
% 0.85/2.03
% 0.85/2.03 # -------------------------------------------------
% 0.85/2.03 # User time : 0.132 s
% 0.85/2.03 # System time : 0.021 s
% 0.85/2.03 # Total time : 0.153 s
% 0.85/2.03 # Maximum resident set size: 19968 pages
%------------------------------------------------------------------------------