TSTP Solution File: CSR066+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR066+2 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n023.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.26s 1.44s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 7 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 3 ( 2 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 : 28 ( 0 sgn 15 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query116,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',query116) ).
fof(ax1_391,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/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_391) ).
fof(ax1_563,axiom,
! [X13] :
( isa(X13,c_tptpcol_16_25972)
=> tptpcol_16_25972(X13) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_563) ).
fof(ax1_64,axiom,
! [X7,X8,X3,X9] :
( ( isa(X7,X8)
& relationexistsall(X3,X9,X8) )
=> isa(f_relationexistsallfn(X7,X3,X9,X8),X9) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_64) ).
fof(ax1_97,axiom,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_97) ).
fof(ax1_392,axiom,
relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_392) ).
fof(ax1_913,axiom,
! [X13] :
( shavingrazor_manual(X13)
=> isa(X13,c_shavingrazor_manual) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_913) ).
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)],[query116]) ).
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,
! [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)],[ax1_391])]) ).
fof(c_0_10,plain,
! [X14] :
( ~ isa(X14,c_tptpcol_16_25972)
| tptpcol_16_25972(X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_563])]) ).
fof(c_0_11,plain,
! [X10,X11,X12,X13] :
( ~ isa(X10,X11)
| ~ relationexistsall(X12,X13,X11)
| isa(f_relationexistsallfn(X10,X12,X13,X11),X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_64])]) ).
cnf(c_0_12,negated_conjecture,
( ~ tptpcol_16_25972(X1)
| ~ tptp_8_271(X1,c_theprototypicalshavingrazor_manual) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,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_14,plain,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
inference(split_conjunct,[status(thm)],[ax1_97]) ).
cnf(c_0_15,plain,
( tptpcol_16_25972(X1)
| ~ isa(X1,c_tptpcol_16_25972) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( isa(f_relationexistsallfn(X1,X2,X3,X4),X3)
| ~ relationexistsall(X2,X3,X4)
| ~ isa(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,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_12,c_0_13]),c_0_14])]) ).
cnf(c_0_18,plain,
( tptpcol_16_25972(f_relationexistsallfn(X1,X2,c_tptpcol_16_25972,X3))
| ~ relationexistsall(X2,c_tptpcol_16_25972,X3)
| ~ isa(X1,X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
inference(split_conjunct,[status(thm)],[ax1_392]) ).
fof(c_0_20,plain,
! [X14] :
( ~ shavingrazor_manual(X14)
| isa(X14,c_shavingrazor_manual) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_913])]) ).
cnf(c_0_21,negated_conjecture,
~ isa(c_theprototypicalshavingrazor_manual,c_shavingrazor_manual),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_22,plain,
( isa(X1,c_shavingrazor_manual)
| ~ shavingrazor_manual(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : CSR066+2 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n023.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 : Sat Jun 11 04:04:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.26/1.44 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.26/1.44 # Preprocessing time : 0.049 s
% 0.26/1.44
% 0.26/1.44 # Proof found!
% 0.26/1.44 # SZS status Theorem
% 0.26/1.44 # SZS output start CNFRefutation
% See solution above
% 0.26/1.44 # Proof object total steps : 24
% 0.26/1.44 # Proof object clause steps : 11
% 0.26/1.44 # Proof object formula steps : 13
% 0.26/1.44 # Proof object conjectures : 7
% 0.26/1.44 # Proof object clause conjectures : 4
% 0.26/1.44 # Proof object formula conjectures : 3
% 0.26/1.44 # Proof object initial clauses used : 7
% 0.26/1.44 # Proof object initial formulas used : 7
% 0.26/1.44 # Proof object generating inferences : 4
% 0.26/1.44 # Proof object simplifying inferences : 6
% 0.26/1.44 # Training examples: 0 positive, 0 negative
% 0.26/1.44 # Parsed axioms : 1132
% 0.26/1.44 # Removed by relevancy pruning/SinE : 0
% 0.26/1.44 # Initial clauses : 1133
% 0.26/1.44 # Removed in clause preprocessing : 0
% 0.26/1.44 # Initial clauses in saturation : 1133
% 0.26/1.44 # Processed clauses : 2566
% 0.26/1.44 # ...of these trivial : 353
% 0.26/1.44 # ...subsumed : 82
% 0.26/1.44 # ...remaining for further processing : 2131
% 0.26/1.44 # Other redundant clauses eliminated : 0
% 0.26/1.44 # Clauses deleted for lack of memory : 0
% 0.26/1.44 # Backward-subsumed : 1
% 0.26/1.44 # Backward-rewritten : 12
% 0.26/1.44 # Generated clauses : 3852
% 0.26/1.44 # ...of the previous two non-trivial : 3563
% 0.26/1.44 # Contextual simplify-reflections : 0
% 0.26/1.44 # Paramodulations : 3852
% 0.26/1.44 # Factorizations : 0
% 0.26/1.44 # Equation resolutions : 0
% 0.26/1.44 # Current number of processed clauses : 2118
% 0.26/1.44 # Positive orientable unit clauses : 787
% 0.26/1.44 # Positive unorientable unit clauses: 0
% 0.26/1.44 # Negative unit clauses : 168
% 0.26/1.44 # Non-unit-clauses : 1163
% 0.26/1.44 # Current number of unprocessed clauses: 2123
% 0.26/1.44 # ...number of literals in the above : 4867
% 0.26/1.44 # Current number of archived formulas : 0
% 0.26/1.44 # Current number of archived clauses : 13
% 0.26/1.44 # Clause-clause subsumption calls (NU) : 193684
% 0.26/1.44 # Rec. Clause-clause subsumption calls : 180171
% 0.26/1.44 # Non-unit clause-clause subsumptions : 83
% 0.26/1.44 # Unit Clause-clause subsumption calls : 145620
% 0.26/1.44 # Rewrite failures with RHS unbound : 0
% 0.26/1.44 # BW rewrite match attempts : 12
% 0.26/1.44 # BW rewrite match successes : 9
% 0.26/1.44 # Condensation attempts : 0
% 0.26/1.44 # Condensation successes : 0
% 0.26/1.44 # Termbank termtop insertions : 75430
% 0.26/1.44
% 0.26/1.44 # -------------------------------------------------
% 0.26/1.44 # User time : 0.151 s
% 0.26/1.44 # System time : 0.005 s
% 0.26/1.44 # Total time : 0.156 s
% 0.26/1.44 # Maximum resident set size: 13772 pages
%------------------------------------------------------------------------------