TSTP Solution File: PUZ130+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PUZ130+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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 : Mon Jul 18 18:08:47 EDT 2022
% Result : Theorem 7.42s 2.36s
% Output : CNFRefutation 7.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of clauses : 27 ( 19 unt; 0 nHn; 27 RR)
% Number of literals : 43 ( 4 equ; 18 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
( pet(X1)
| ~ cat(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xb4b0uxc/lgb.p',i_0_7) ).
cnf(i_0_2,plain,
cat(garfield),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xb4b0uxc/lgb.p',i_0_2) ).
cnf(i_0_6,plain,
( pet(X1)
| ~ dog(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xb4b0uxc/lgb.p',i_0_6) ).
cnf(i_0_4,plain,
dog(odie),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xb4b0uxc/lgb.p',i_0_4) ).
cnf(i_0_21,plain,
( X1 = owner_of(X2)
| ~ pet(X2)
| ~ human(X1)
| ~ owner(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xb4b0uxc/lgb.p',i_0_21) ).
cnf(i_0_14,plain,
owner(jon,garfield),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xb4b0uxc/lgb.p',i_0_14) ).
cnf(i_0_9,plain,
human(jon),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xb4b0uxc/lgb.p',i_0_9) ).
cnf(i_0_13,plain,
owner(jon,odie),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xb4b0uxc/lgb.p',i_0_13) ).
cnf(i_0_19,plain,
( hates(owner_of(X1),owner_of(X2))
| ~ cat(X1)
| ~ dog(X2)
| ~ chased(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xb4b0uxc/lgb.p',i_0_19) ).
cnf(i_0_22,plain,
chased(odie,garfield),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xb4b0uxc/lgb.p',i_0_22) ).
cnf(i_0_23,negated_conjecture,
~ hates(jon,jon),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xb4b0uxc/lgb.p',i_0_23) ).
cnf(c_0_35,plain,
( pet(X1)
| ~ cat(X1) ),
i_0_7 ).
cnf(c_0_36,plain,
cat(garfield),
i_0_2 ).
cnf(c_0_37,plain,
( pet(X1)
| ~ dog(X1) ),
i_0_6 ).
cnf(c_0_38,plain,
dog(odie),
i_0_4 ).
cnf(c_0_39,plain,
( X1 = owner_of(X2)
| ~ pet(X2)
| ~ human(X1)
| ~ owner(X1,X2) ),
i_0_21 ).
cnf(c_0_40,plain,
owner(jon,garfield),
i_0_14 ).
cnf(c_0_41,plain,
pet(garfield),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,plain,
human(jon),
i_0_9 ).
cnf(c_0_43,plain,
owner(jon,odie),
i_0_13 ).
cnf(c_0_44,plain,
pet(odie),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,plain,
( hates(owner_of(X1),owner_of(X2))
| ~ cat(X1)
| ~ dog(X2)
| ~ chased(X2,X1) ),
i_0_19 ).
cnf(c_0_46,plain,
chased(odie,garfield),
i_0_22 ).
cnf(c_0_47,plain,
owner_of(garfield) = jon,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42])]) ).
cnf(c_0_48,plain,
owner_of(odie) = jon,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_43]),c_0_44]),c_0_42])]) ).
cnf(c_0_49,negated_conjecture,
~ hates(jon,jon),
i_0_23 ).
cnf(c_0_50,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48]),c_0_36]),c_0_38])]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : PUZ130+1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n018.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 : Sat May 28 22:54:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.42/2.36 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.42/2.36 # No SInE strategy applied
% 7.42/2.36 # Trying AutoSched0 for 150 seconds
% 7.42/2.36 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S024I
% 7.42/2.36 # and selection function SelectOptimalRestrPDepth2.
% 7.42/2.36 #
% 7.42/2.36 # Preprocessing time : 0.023 s
% 7.42/2.36 # Presaturation interreduction done
% 7.42/2.36
% 7.42/2.36 # Proof found!
% 7.42/2.36 # SZS status Theorem
% 7.42/2.36 # SZS output start CNFRefutation
% See solution above
% 7.42/2.36 # Training examples: 0 positive, 0 negative
% 7.42/2.36
% 7.42/2.36 # -------------------------------------------------
% 7.42/2.36 # User time : 0.021 s
% 7.42/2.36 # System time : 0.008 s
% 7.42/2.36 # Total time : 0.029 s
% 7.42/2.36 # Maximum resident set size: 7124 pages
% 7.42/2.36
%------------------------------------------------------------------------------