TSTP Solution File: CSR066+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR066+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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 02:47:18 EDT 2022
% Result : Theorem 7.67s 2.31s
% Output : CNFRefutation 7.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 9 unt; 0 nHn; 20 RR)
% Number of literals : 33 ( 0 equ; 15 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_31,plain,
( isa(X1,c_shavingrazor_manual)
| ~ shavingrazor_manual(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_qg41i6h/input.p',i_0_31) ).
cnf(i_0_11,plain,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_qg41i6h/input.p',i_0_11) ).
cnf(i_0_4,plain,
( isa(f_relationexistsallfn(X1,X2,X3,X4),X3)
| ~ isa(X1,X4)
| ~ relationexistsall(X2,X3,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_qg41i6h/input.p',i_0_4) ).
cnf(i_0_10,plain,
relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_qg41i6h/input.p',i_0_10) ).
cnf(i_0_32,plain,
( tptpcol_16_25972(X1)
| ~ isa(X1,c_tptpcol_16_25972) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_qg41i6h/input.p',i_0_32) ).
cnf(i_0_9,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/sandbox2/tmp/enigma-theBenchmark.p-_qg41i6h/input.p',i_0_9) ).
cnf(i_0_74,negated_conjecture,
( ~ tptpcol_16_25972(X1)
| ~ tptp_8_271(X1,c_theprototypicalshavingrazor_manual) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_qg41i6h/input.p',i_0_74) ).
cnf(c_0_82,plain,
( isa(X1,c_shavingrazor_manual)
| ~ shavingrazor_manual(X1) ),
i_0_31 ).
cnf(c_0_83,plain,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
i_0_11 ).
cnf(c_0_84,plain,
( isa(f_relationexistsallfn(X1,X2,X3,X4),X3)
| ~ isa(X1,X4)
| ~ relationexistsall(X2,X3,X4) ),
i_0_4 ).
cnf(c_0_85,plain,
isa(c_theprototypicalshavingrazor_manual,c_shavingrazor_manual),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_86,plain,
( isa(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,X1,X2,c_shavingrazor_manual),X2)
| ~ relationexistsall(X1,X2,c_shavingrazor_manual) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_87,plain,
relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
i_0_10 ).
cnf(c_0_88,plain,
( tptpcol_16_25972(X1)
| ~ isa(X1,c_tptpcol_16_25972) ),
i_0_32 ).
cnf(c_0_89,plain,
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_86,c_0_87]) ).
cnf(c_0_90,plain,
( tptp_8_271(f_relationexistsallfn(X1,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X1)
| ~ shavingrazor_manual(X1) ),
i_0_9 ).
cnf(c_0_91,negated_conjecture,
( ~ tptpcol_16_25972(X1)
| ~ tptp_8_271(X1,c_theprototypicalshavingrazor_manual) ),
i_0_74 ).
cnf(c_0_92,plain,
tptpcol_16_25972(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual)),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_93,plain,
tptp_8_271(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_theprototypicalshavingrazor_manual),
inference(spm,[status(thm)],[c_0_90,c_0_83]) ).
cnf(c_0_94,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : CSR066+1 : TPTP v8.1.0. Released v3.4.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n023.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 : Fri Jun 10 01:54:54 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.67/2.31 # ENIGMATIC: Solved by autoschedule:
% 7.67/2.31 # No SInE strategy applied
% 7.67/2.31 # Trying AutoSched0 for 150 seconds
% 7.67/2.31 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S008N
% 7.67/2.31 # and selection function SelectSmallestNegLit.
% 7.67/2.31 #
% 7.67/2.31 # Preprocessing time : 0.024 s
% 7.67/2.31 # Presaturation interreduction done
% 7.67/2.31
% 7.67/2.31 # Proof found!
% 7.67/2.31 # SZS status Theorem
% 7.67/2.31 # SZS output start CNFRefutation
% See solution above
% 7.67/2.31 # Training examples: 0 positive, 0 negative
% 7.67/2.31
% 7.67/2.31 # -------------------------------------------------
% 7.67/2.31 # User time : 0.029 s
% 7.67/2.31 # System time : 0.007 s
% 7.67/2.31 # Total time : 0.036 s
% 7.67/2.31 # Maximum resident set size: 7120 pages
% 7.67/2.31
%------------------------------------------------------------------------------