TSTP Solution File: CSR066+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR066+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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 20.42s 4.67s
% Output : CNFRefutation 20.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 7 unt; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 41 ( 18 ~; 13 |; 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 : 26 ( 0 sgn 15 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query166,conjecture,
? [X15] :
( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))
=> ( tptp_8_271(X15,c_theprototypicalshavingrazor_manual)
& tptpcol_16_25972(X15) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query166) ).
fof(ax2_5089,axiom,
! [X15] :
( isa(X15,c_tptpcol_16_25972)
=> tptpcol_16_25972(X15) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_5089) ).
fof(ax2_3627,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+2.ax',ax2_3627) ).
fof(ax2_7743,axiom,
! [X15] :
( shavingrazor_manual(X15)
=> isa(X15,c_shavingrazor_manual) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_7743) ).
fof(ax2_195,axiom,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_195) ).
fof(ax2_453,axiom,
! [X7,X8,X9,X10] :
( ( isa(X7,X8)
& relationexistsall(X9,X10,X8) )
=> isa(f_relationexistsallfn(X7,X9,X10,X8),X10) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_453) ).
fof(ax2_3628,axiom,
relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_3628) ).
fof(c_0_7,negated_conjecture,
~ ? [X15] :
( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))
=> ( tptp_8_271(X15,c_theprototypicalshavingrazor_manual)
& tptpcol_16_25972(X15) ) ),
inference(assume_negation,[status(cth)],[query166]) ).
fof(c_0_8,negated_conjecture,
! [X5993] :
( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))
& ( ~ tptp_8_271(X5993,c_theprototypicalshavingrazor_manual)
| ~ tptpcol_16_25972(X5993) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
fof(c_0_9,plain,
! [X2092] :
( ~ isa(X2092,c_tptpcol_16_25972)
| tptpcol_16_25972(X2092) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_5089])]) ).
cnf(c_0_10,negated_conjecture,
( ~ tptp_8_271(X1,c_theprototypicalshavingrazor_manual)
| ~ tptpcol_16_25972(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( tptpcol_16_25972(X1)
| ~ isa(X1,c_tptpcol_16_25972) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X1086] :
( ~ shavingrazor_manual(X1086)
| tptp_8_271(f_relationexistsallfn(X1086,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X1086) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_3627])]) ).
fof(c_0_13,plain,
! [X5572] :
( ~ shavingrazor_manual(X5572)
| isa(X5572,c_shavingrazor_manual) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_7743])]) ).
cnf(c_0_14,negated_conjecture,
( ~ tptp_8_271(X1,c_theprototypicalshavingrazor_manual)
| ~ isa(X1,c_tptpcol_16_25972) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,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_12]) ).
cnf(c_0_16,plain,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
inference(split_conjunct,[status(thm)],[ax2_195]) ).
fof(c_0_17,plain,
! [X146,X147,X148,X149] :
( ~ isa(X146,X147)
| ~ relationexistsall(X148,X149,X147)
| isa(f_relationexistsallfn(X146,X148,X149,X147),X149) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_453])]) ).
cnf(c_0_18,plain,
( isa(X1,c_shavingrazor_manual)
| ~ shavingrazor_manual(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
~ 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_14,c_0_15]),c_0_16])]) ).
cnf(c_0_20,plain,
( isa(f_relationexistsallfn(X1,X3,X4,X2),X4)
| ~ isa(X1,X2)
| ~ relationexistsall(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
inference(split_conjunct,[status(thm)],[ax2_3628]) ).
cnf(c_0_22,plain,
isa(c_theprototypicalshavingrazor_manual,c_shavingrazor_manual),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR066+3 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n026.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 : Fri Jun 10 07:20:50 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.41/0.60 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.60 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.41/0.60 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.41/0.60 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 20.42/4.67 # ENIGMATIC: Solved by autoschedule:
% 20.42/4.67 # No SInE strategy applied
% 20.42/4.67 # Trying AutoSched0 for 150 seconds
% 20.42/4.67 # AutoSched0-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_S0Y
% 20.42/4.67 # and selection function SelectMaxLComplexAvoidPosPred.
% 20.42/4.67 #
% 20.42/4.67 # Preprocessing time : 0.314 s
% 20.42/4.67
% 20.42/4.67 # Proof found!
% 20.42/4.67 # SZS status Theorem
% 20.42/4.67 # SZS output start CNFRefutation
% See solution above
% 20.42/4.67 # Training examples: 0 positive, 0 negative
% 20.42/4.67
% 20.42/4.67 # -------------------------------------------------
% 20.42/4.67 # User time : 1.470 s
% 20.42/4.67 # System time : 0.065 s
% 20.42/4.67 # Total time : 1.535 s
% 20.42/4.67 # Maximum resident set size: 8692 pages
% 20.42/4.67
%------------------------------------------------------------------------------