TSTP Solution File: CSR056+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR056+2 : 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:01:56 EDT 2022
% Result : Theorem 0.28s 1.46s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 11 unt; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 39 ( 17 ~; 13 |; 3 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 17 ( 1 sgn 9 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query106,conjecture,
? [X22] :
( mtvisible(c_tptp_member3717_mt)
=> tptpofobject(c_tptpartsupplies,X22) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query106) ).
fof(ax1_1123,axiom,
! [X20,X21] :
( ( mtvisible(X20)
& genlmt(X20,X21) )
=> mtvisible(X21) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_1123) ).
fof(ax1_279,axiom,
genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_279) ).
fof(ax1_202,axiom,
! [X10] :
( ( mtvisible(c_tptp_spindleheadmt)
& supplies(X10) )
=> tptpofobject(X10,f_tptpquantityfn_14(n_232)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_202) ).
fof(ax1_40,axiom,
( mtvisible(c_cyclistsmt)
=> artsupplies(c_tptpartsupplies) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_40) ).
fof(ax1_254,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_254) ).
fof(ax1_238,axiom,
! [X1] :
( artsupplies(X1)
=> supplies(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_238) ).
fof(c_0_7,negated_conjecture,
~ ? [X22] :
( mtvisible(c_tptp_member3717_mt)
=> tptpofobject(c_tptpartsupplies,X22) ),
inference(assume_negation,[status(cth)],[query106]) ).
fof(c_0_8,plain,
! [X22,X23] :
( ~ mtvisible(X22)
| ~ genlmt(X22,X23)
| mtvisible(X23) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_1123])]) ).
fof(c_0_9,negated_conjecture,
! [X23] :
( mtvisible(c_tptp_member3717_mt)
& ~ tptpofobject(c_tptpartsupplies,X23) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_10,plain,
( mtvisible(X1)
| ~ genlmt(X2,X1)
| ~ mtvisible(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[ax1_279]) ).
cnf(c_0_12,negated_conjecture,
mtvisible(c_tptp_member3717_mt),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X11] :
( ~ mtvisible(c_tptp_spindleheadmt)
| ~ supplies(X11)
| tptpofobject(X11,f_tptpquantityfn_14(n_232)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_202])]) ).
fof(c_0_14,plain,
( ~ mtvisible(c_cyclistsmt)
| artsupplies(c_tptpartsupplies) ),
inference(fof_nnf,[status(thm)],[ax1_40]) ).
cnf(c_0_15,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(split_conjunct,[status(thm)],[ax1_254]) ).
cnf(c_0_16,plain,
mtvisible(c_tptp_spindleheadmt),
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,
( tptpofobject(X1,f_tptpquantityfn_14(n_232))
| ~ supplies(X1)
| ~ mtvisible(c_tptp_spindleheadmt) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X2] :
( ~ artsupplies(X2)
| supplies(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_238])]) ).
cnf(c_0_19,plain,
( artsupplies(c_tptpartsupplies)
| ~ mtvisible(c_cyclistsmt) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_15]),c_0_16])]) ).
cnf(c_0_21,negated_conjecture,
~ tptpofobject(c_tptpartsupplies,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,plain,
( tptpofobject(X1,f_tptpquantityfn_14(n_232))
| ~ supplies(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_16])]) ).
cnf(c_0_23,plain,
( supplies(X1)
| ~ artsupplies(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
artsupplies(c_tptpartsupplies),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
cnf(c_0_25,negated_conjecture,
~ supplies(c_tptpartsupplies),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR056+2 : TPTP v8.1.0. Released v3.4.0.
% 0.13/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 10:59:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.28/1.46 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.28/1.46 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.28/1.46 # Preprocessing time : 0.033 s
% 0.28/1.46
% 0.28/1.46 # Failure: Out of unprocessed clauses!
% 0.28/1.46 # OLD status GaveUp
% 0.28/1.46 # Parsed axioms : 1132
% 0.28/1.46 # Removed by relevancy pruning/SinE : 1089
% 0.28/1.46 # Initial clauses : 44
% 0.28/1.46 # Removed in clause preprocessing : 0
% 0.28/1.46 # Initial clauses in saturation : 44
% 0.28/1.46 # Processed clauses : 61
% 0.28/1.46 # ...of these trivial : 0
% 0.28/1.46 # ...subsumed : 4
% 0.28/1.46 # ...remaining for further processing : 57
% 0.28/1.46 # Other redundant clauses eliminated : 0
% 0.28/1.46 # Clauses deleted for lack of memory : 0
% 0.28/1.46 # Backward-subsumed : 0
% 0.28/1.46 # Backward-rewritten : 1
% 0.28/1.46 # Generated clauses : 27
% 0.28/1.46 # ...of the previous two non-trivial : 19
% 0.28/1.46 # Contextual simplify-reflections : 1
% 0.28/1.46 # Paramodulations : 27
% 0.28/1.46 # Factorizations : 0
% 0.28/1.46 # Equation resolutions : 0
% 0.28/1.46 # Current number of processed clauses : 56
% 0.28/1.46 # Positive orientable unit clauses : 23
% 0.28/1.46 # Positive unorientable unit clauses: 0
% 0.28/1.46 # Negative unit clauses : 2
% 0.28/1.46 # Non-unit-clauses : 31
% 0.28/1.46 # Current number of unprocessed clauses: 0
% 0.28/1.46 # ...number of literals in the above : 0
% 0.28/1.46 # Current number of archived formulas : 0
% 0.28/1.46 # Current number of archived clauses : 1
% 0.28/1.46 # Clause-clause subsumption calls (NU) : 125
% 0.28/1.46 # Rec. Clause-clause subsumption calls : 109
% 0.28/1.46 # Non-unit clause-clause subsumptions : 5
% 0.28/1.46 # Unit Clause-clause subsumption calls : 15
% 0.28/1.46 # Rewrite failures with RHS unbound : 0
% 0.28/1.46 # BW rewrite match attempts : 1
% 0.28/1.46 # BW rewrite match successes : 1
% 0.28/1.46 # Condensation attempts : 0
% 0.28/1.46 # Condensation successes : 0
% 0.28/1.46 # Termbank termtop insertions : 9277
% 0.28/1.46
% 0.28/1.46 # -------------------------------------------------
% 0.28/1.46 # User time : 0.029 s
% 0.28/1.46 # System time : 0.006 s
% 0.28/1.46 # Total time : 0.035 s
% 0.28/1.46 # Maximum resident set size: 5212 pages
% 0.28/1.46 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.28/1.46 # Preprocessing time : 0.052 s
% 0.28/1.46
% 0.28/1.46 # Proof found!
% 0.28/1.46 # SZS status Theorem
% 0.28/1.46 # SZS output start CNFRefutation
% See solution above
% 0.28/1.46 # Proof object total steps : 27
% 0.28/1.46 # Proof object clause steps : 14
% 0.28/1.46 # Proof object formula steps : 13
% 0.28/1.46 # Proof object conjectures : 6
% 0.28/1.46 # Proof object clause conjectures : 3
% 0.28/1.46 # Proof object formula conjectures : 3
% 0.28/1.46 # Proof object initial clauses used : 8
% 0.28/1.46 # Proof object initial formulas used : 7
% 0.28/1.46 # Proof object generating inferences : 4
% 0.28/1.46 # Proof object simplifying inferences : 9
% 0.28/1.46 # Training examples: 0 positive, 0 negative
% 0.28/1.46 # Parsed axioms : 1132
% 0.28/1.46 # Removed by relevancy pruning/SinE : 0
% 0.28/1.46 # Initial clauses : 1133
% 0.28/1.46 # Removed in clause preprocessing : 0
% 0.28/1.46 # Initial clauses in saturation : 1133
% 0.28/1.46 # Processed clauses : 1343
% 0.28/1.46 # ...of these trivial : 51
% 0.28/1.46 # ...subsumed : 30
% 0.28/1.46 # ...remaining for further processing : 1262
% 0.28/1.46 # Other redundant clauses eliminated : 0
% 0.28/1.46 # Clauses deleted for lack of memory : 0
% 0.28/1.46 # Backward-subsumed : 1
% 0.28/1.46 # Backward-rewritten : 17
% 0.28/1.46 # Generated clauses : 2660
% 0.28/1.46 # ...of the previous two non-trivial : 2445
% 0.28/1.46 # Contextual simplify-reflections : 0
% 0.28/1.46 # Paramodulations : 2660
% 0.28/1.46 # Factorizations : 0
% 0.28/1.46 # Equation resolutions : 0
% 0.28/1.46 # Current number of processed clauses : 1244
% 0.28/1.46 # Positive orientable unit clauses : 418
% 0.28/1.46 # Positive unorientable unit clauses: 0
% 0.28/1.46 # Negative unit clauses : 38
% 0.28/1.46 # Non-unit-clauses : 788
% 0.28/1.46 # Current number of unprocessed clauses: 2207
% 0.28/1.46 # ...number of literals in the above : 3860
% 0.28/1.46 # Current number of archived formulas : 0
% 0.28/1.46 # Current number of archived clauses : 18
% 0.28/1.46 # Clause-clause subsumption calls (NU) : 102580
% 0.28/1.46 # Rec. Clause-clause subsumption calls : 95061
% 0.28/1.46 # Non-unit clause-clause subsumptions : 31
% 0.28/1.46 # Unit Clause-clause subsumption calls : 12893
% 0.28/1.46 # Rewrite failures with RHS unbound : 0
% 0.28/1.46 # BW rewrite match attempts : 7
% 0.28/1.46 # BW rewrite match successes : 4
% 0.28/1.46 # Condensation attempts : 0
% 0.28/1.46 # Condensation successes : 0
% 0.28/1.46 # Termbank termtop insertions : 66796
% 0.28/1.46
% 0.28/1.46 # -------------------------------------------------
% 0.28/1.46 # User time : 0.108 s
% 0.28/1.46 # System time : 0.005 s
% 0.28/1.46 # Total time : 0.113 s
% 0.28/1.46 # Maximum resident set size: 11404 pages
%------------------------------------------------------------------------------