TSTP Solution File: CSR068+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR068+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:08 EDT 2022
% Result : Theorem 0.80s 2.01s
% Output : CNFRefutation 0.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 8 unt; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 28 ( 12 ~; 9 |; 3 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 10 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query168,conjecture,
( mtvisible(c_tptp_member2356_mt)
=> tptpofobject(c_theprototypicalfurpelt,f_tptpquantityfn_1(n_328)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query168) ).
fof(ax2_7997,axiom,
! [X21,X22] :
( ( mtvisible(X21)
& genlmt(X21,X22) )
=> mtvisible(X22) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_7997) ).
fof(ax2_1436,axiom,
! [X2] :
( ( mtvisible(c_tptp_spindleheadmt)
& furpelt(X2) )
=> tptpofobject(X2,f_tptpquantityfn_1(n_328)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_1436) ).
fof(ax2_1607,axiom,
genlmt(c_tptp_member2356_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_1607) ).
fof(ax2_385,axiom,
furpelt(c_theprototypicalfurpelt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_385) ).
fof(c_0_5,negated_conjecture,
~ ( mtvisible(c_tptp_member2356_mt)
=> tptpofobject(c_theprototypicalfurpelt,f_tptpquantityfn_1(n_328)) ),
inference(assume_negation,[status(cth)],[query168]) ).
fof(c_0_6,plain,
! [X23,X24] :
( ~ mtvisible(X23)
| ~ genlmt(X23,X24)
| mtvisible(X24) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_7997])]) ).
fof(c_0_7,negated_conjecture,
( mtvisible(c_tptp_member2356_mt)
& ~ tptpofobject(c_theprototypicalfurpelt,f_tptpquantityfn_1(n_328)) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X3] :
( ~ mtvisible(c_tptp_spindleheadmt)
| ~ furpelt(X3)
| tptpofobject(X3,f_tptpquantityfn_1(n_328)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_1436])]) ).
cnf(c_0_9,plain,
( mtvisible(X1)
| ~ genlmt(X2,X1)
| ~ mtvisible(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
genlmt(c_tptp_member2356_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[ax2_1607]) ).
cnf(c_0_11,negated_conjecture,
mtvisible(c_tptp_member2356_mt),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( tptpofobject(X1,f_tptpquantityfn_1(n_328))
| ~ furpelt(X1)
| ~ mtvisible(c_tptp_spindleheadmt) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_14,negated_conjecture,
~ tptpofobject(c_theprototypicalfurpelt,f_tptpquantityfn_1(n_328)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,plain,
( tptpofobject(X1,f_tptpquantityfn_1(n_328))
| ~ furpelt(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_16,plain,
furpelt(c_theprototypicalfurpelt),
inference(split_conjunct,[status(thm)],[ax2_385]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR068+3 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n021.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 : Sat Jun 11 13:13:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.80/2.01 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.80/2.01 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.80/2.01 # Preprocessing time : 0.166 s
% 0.80/2.01
% 0.80/2.01 # Proof found!
% 0.80/2.01 # SZS status Theorem
% 0.80/2.01 # SZS output start CNFRefutation
% See solution above
% 0.80/2.01 # Proof object total steps : 18
% 0.80/2.01 # Proof object clause steps : 9
% 0.80/2.01 # Proof object formula steps : 9
% 0.80/2.01 # Proof object conjectures : 6
% 0.80/2.01 # Proof object clause conjectures : 3
% 0.80/2.01 # Proof object formula conjectures : 3
% 0.80/2.01 # Proof object initial clauses used : 6
% 0.80/2.01 # Proof object initial formulas used : 5
% 0.80/2.01 # Proof object generating inferences : 2
% 0.80/2.01 # Proof object simplifying inferences : 6
% 0.80/2.01 # Training examples: 0 positive, 0 negative
% 0.80/2.01 # Parsed axioms : 8006
% 0.80/2.01 # Removed by relevancy pruning/SinE : 7940
% 0.80/2.01 # Initial clauses : 67
% 0.80/2.01 # Removed in clause preprocessing : 0
% 0.80/2.01 # Initial clauses in saturation : 67
% 0.80/2.01 # Processed clauses : 73
% 0.80/2.01 # ...of these trivial : 3
% 0.80/2.01 # ...subsumed : 15
% 0.80/2.01 # ...remaining for further processing : 55
% 0.80/2.01 # Other redundant clauses eliminated : 0
% 0.80/2.01 # Clauses deleted for lack of memory : 0
% 0.80/2.01 # Backward-subsumed : 0
% 0.80/2.01 # Backward-rewritten : 2
% 0.80/2.01 # Generated clauses : 33
% 0.80/2.01 # ...of the previous two non-trivial : 25
% 0.80/2.01 # Contextual simplify-reflections : 0
% 0.80/2.01 # Paramodulations : 33
% 0.80/2.01 # Factorizations : 0
% 0.80/2.01 # Equation resolutions : 0
% 0.80/2.01 # Current number of processed clauses : 53
% 0.80/2.01 # Positive orientable unit clauses : 29
% 0.80/2.01 # Positive unorientable unit clauses: 0
% 0.80/2.01 # Negative unit clauses : 1
% 0.80/2.01 # Non-unit-clauses : 23
% 0.80/2.01 # Current number of unprocessed clauses: 15
% 0.80/2.01 # ...number of literals in the above : 23
% 0.80/2.01 # Current number of archived formulas : 0
% 0.80/2.01 # Current number of archived clauses : 2
% 0.80/2.01 # Clause-clause subsumption calls (NU) : 99
% 0.80/2.01 # Rec. Clause-clause subsumption calls : 82
% 0.80/2.01 # Non-unit clause-clause subsumptions : 15
% 0.80/2.01 # Unit Clause-clause subsumption calls : 27
% 0.80/2.01 # Rewrite failures with RHS unbound : 0
% 0.80/2.01 # BW rewrite match attempts : 1
% 0.80/2.01 # BW rewrite match successes : 1
% 0.80/2.01 # Condensation attempts : 0
% 0.80/2.01 # Condensation successes : 0
% 0.80/2.01 # Termbank termtop insertions : 53636
% 0.80/2.01
% 0.80/2.01 # -------------------------------------------------
% 0.80/2.01 # User time : 0.153 s
% 0.80/2.01 # System time : 0.016 s
% 0.80/2.01 # Total time : 0.169 s
% 0.80/2.01 # Maximum resident set size: 19716 pages
%------------------------------------------------------------------------------