TSTP Solution File: CSR066+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR066+2 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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 02:47:19 EDT 2022
% Result : Theorem 11.84s 3.23s
% Output : CNFRefutation 11.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 7 unt; 0 nHn; 19 RR)
% Number of literals : 33 ( 0 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-4 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1065,negated_conjecture,
( ~ tptpcol_16_25972(X1)
| ~ tptp_8_271(X1,c_theprototypicalshavingrazor_manual) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v5cm_fg5/input.p',i_0_1065) ).
cnf(i_0_604,plain,
( tptpcol_16_25972(X1)
| ~ isa(X1,c_tptpcol_16_25972) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v5cm_fg5/input.p',i_0_604) ).
cnf(i_0_437,plain,
( tptp_8_271(f_relationexistsallfn(X1,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X1)
| ~ shavingrazor_manual(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v5cm_fg5/input.p',i_0_437) ).
cnf(i_0_1045,plain,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v5cm_fg5/input.p',i_0_1045) ).
cnf(i_0_691,plain,
( isa(f_relationexistsallfn(X1,X2,X3,X4),X3)
| ~ isa(X1,X4)
| ~ relationexistsall(X2,X3,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v5cm_fg5/input.p',i_0_691) ).
cnf(i_0_438,plain,
relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v5cm_fg5/input.p',i_0_438) ).
cnf(i_0_976,plain,
( isa(X1,c_shavingrazor_manual)
| ~ shavingrazor_manual(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v5cm_fg5/input.p',i_0_976) ).
cnf(c_0_1073,negated_conjecture,
( ~ tptpcol_16_25972(X1)
| ~ tptp_8_271(X1,c_theprototypicalshavingrazor_manual) ),
i_0_1065 ).
cnf(c_0_1074,plain,
( tptpcol_16_25972(X1)
| ~ isa(X1,c_tptpcol_16_25972) ),
i_0_604 ).
cnf(c_0_1075,negated_conjecture,
( ~ tptp_8_271(X1,c_theprototypicalshavingrazor_manual)
| ~ isa(X1,c_tptpcol_16_25972) ),
inference(spm,[status(thm)],[c_0_1073,c_0_1074]) ).
cnf(c_0_1076,plain,
( tptp_8_271(f_relationexistsallfn(X1,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X1)
| ~ shavingrazor_manual(X1) ),
i_0_437 ).
cnf(c_0_1077,plain,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
i_0_1045 ).
cnf(c_0_1078,plain,
( isa(f_relationexistsallfn(X1,X2,X3,X4),X3)
| ~ isa(X1,X4)
| ~ relationexistsall(X2,X3,X4) ),
i_0_691 ).
cnf(c_0_1079,plain,
relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
i_0_438 ).
cnf(c_0_1080,plain,
( isa(X1,c_shavingrazor_manual)
| ~ shavingrazor_manual(X1) ),
i_0_976 ).
cnf(c_0_1081,plain,
~ 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_1075,c_0_1076]),c_0_1077])]) ).
cnf(c_0_1082,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_1078,c_0_1079]) ).
cnf(c_0_1083,plain,
isa(c_theprototypicalshavingrazor_manual,c_shavingrazor_manual),
inference(spm,[status(thm)],[c_0_1080,c_0_1077]) ).
cnf(c_0_1084,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1081,c_0_1082]),c_0_1083])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : CSR066+2 : TPTP v8.1.0. Released v3.4.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n017.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jun 11 03:06:07 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.48 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 11.84/3.23 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 11.84/3.23 # Version: 2.1pre011
% 11.84/3.23 # Preprocessing time : 0.042 s
% 11.84/3.23
% 11.84/3.23 # Proof found!
% 11.84/3.23 # SZS status Theorem
% 11.84/3.23 # SZS output start CNFRefutation
% See solution above
% 11.84/3.23 # Proof object total steps : 19
% 11.84/3.23 # Proof object clause steps : 12
% 11.84/3.23 # Proof object formula steps : 7
% 11.84/3.23 # Proof object conjectures : 3
% 11.84/3.23 # Proof object clause conjectures : 2
% 11.84/3.23 # Proof object formula conjectures : 1
% 11.84/3.23 # Proof object initial clauses used : 7
% 11.84/3.23 # Proof object initial formulas used : 7
% 11.84/3.23 # Proof object generating inferences : 5
% 11.84/3.23 # Proof object simplifying inferences : 4
% 11.84/3.23 # Training examples: 0 positive, 0 negative
% 11.84/3.23 # Parsed axioms : 1066
% 11.84/3.23 # Removed by relevancy pruning/SinE : 0
% 11.84/3.23 # Initial clauses : 1066
% 11.84/3.23 # Removed in clause preprocessing : 0
% 11.84/3.23 # Initial clauses in saturation : 1066
% 11.84/3.23 # Processed clauses : 5316
% 11.84/3.23 # ...of these trivial : 376
% 11.84/3.23 # ...subsumed : 696
% 11.84/3.23 # ...remaining for further processing : 4244
% 11.84/3.23 # Other redundant clauses eliminated : 0
% 11.84/3.23 # Clauses deleted for lack of memory : 0
% 11.84/3.23 # Backward-subsumed : 0
% 11.84/3.23 # Backward-rewritten : 5
% 11.84/3.23 # Generated clauses : 7903
% 11.84/3.23 # ...of the previous two non-trivial : 7273
% 11.84/3.23 # Contextual simplify-reflections : 1
% 11.84/3.23 # Paramodulations : 7903
% 11.84/3.23 # Factorizations : 0
% 11.84/3.23 # Equation resolutions : 0
% 11.84/3.23 # Propositional unsat checks : 0
% 11.84/3.23 # Propositional unsat check successes : 0
% 11.84/3.23 # Current number of processed clauses : 4239
% 11.84/3.23 # Positive orientable unit clauses : 802
% 11.84/3.23 # Positive unorientable unit clauses: 0
% 11.84/3.23 # Negative unit clauses : 1544
% 11.84/3.23 # Non-unit-clauses : 1893
% 11.84/3.23 # Current number of unprocessed clauses: 3011
% 11.84/3.23 # ...number of literals in the above : 4820
% 11.84/3.23 # Current number of archived formulas : 0
% 11.84/3.23 # Current number of archived clauses : 5
% 11.84/3.23 # Clause-clause subsumption calls (NU) : 556973
% 11.84/3.23 # Rec. Clause-clause subsumption calls : 501391
% 11.84/3.23 # Non-unit clause-clause subsumptions : 113
% 11.84/3.23 # Unit Clause-clause subsumption calls : 1438980
% 11.84/3.23 # Rewrite failures with RHS unbound : 0
% 11.84/3.23 # BW rewrite match attempts : 5
% 11.84/3.23 # BW rewrite match successes : 2
% 11.84/3.23 # Condensation attempts : 0
% 11.84/3.23 # Condensation successes : 0
% 11.84/3.23 # Termbank termtop insertions : 69596
% 11.84/3.23
% 11.84/3.23 # -------------------------------------------------
% 11.84/3.23 # User time : 0.525 s
% 11.84/3.23 # System time : 0.011 s
% 11.84/3.23 # Total time : 0.536 s
% 11.84/3.23 # ...preprocessing : 0.042 s
% 11.84/3.23 # ...main loop : 0.494 s
% 11.84/3.23 # Maximum resident set size: 17884 pages
% 11.84/3.23
%------------------------------------------------------------------------------