TSTP Solution File: PUZ132+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : PUZ132+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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.73s 2.42s
% Output : CNFRefutation 7.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 10 unt; 0 nHn; 18 RR)
% Number of literals : 26 ( 2 equ; 12 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_10,plain,
( beautiful(capital_city(X1))
| ~ country(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xkwzgynf/input.p',i_0_10) ).
cnf(i_0_9,plain,
capital_city(usa) = washington,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xkwzgynf/input.p',i_0_9) ).
cnf(i_0_6,plain,
country(usa),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xkwzgynf/input.p',i_0_6) ).
cnf(i_0_11,negated_conjecture,
( ~ has_crime(washington)
| ~ beautiful(washington) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xkwzgynf/input.p',i_0_11) ).
cnf(i_0_8,plain,
( has_crime(X1)
| ~ city(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xkwzgynf/input.p',i_0_8) ).
cnf(i_0_3,plain,
( city(X1)
| ~ capital(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xkwzgynf/input.p',i_0_3) ).
cnf(i_0_5,plain,
capital(washington),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xkwzgynf/input.p',i_0_5) ).
cnf(c_0_19,plain,
( beautiful(capital_city(X1))
| ~ country(X1) ),
i_0_10 ).
cnf(c_0_20,plain,
capital_city(usa) = washington,
i_0_9 ).
cnf(c_0_21,plain,
country(usa),
i_0_6 ).
cnf(c_0_22,negated_conjecture,
( ~ has_crime(washington)
| ~ beautiful(washington) ),
i_0_11 ).
cnf(c_0_23,plain,
beautiful(washington),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_24,negated_conjecture,
~ has_crime(washington),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_25,plain,
( has_crime(X1)
| ~ city(X1) ),
i_0_8 ).
cnf(c_0_26,plain,
~ city(washington),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,plain,
( city(X1)
| ~ capital(X1) ),
i_0_3 ).
cnf(c_0_28,plain,
capital(washington),
i_0_5 ).
cnf(c_0_29,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PUZ132+1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun May 29 02:19:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.73/2.42 # ENIGMATIC: Solved by autoschedule:
% 7.73/2.42 # No SInE strategy applied
% 7.73/2.42 # Trying AutoSched0 for 150 seconds
% 7.73/2.42 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S04AI
% 7.73/2.42 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.73/2.42 #
% 7.73/2.42 # Preprocessing time : 0.023 s
% 7.73/2.42 # Presaturation interreduction done
% 7.73/2.42
% 7.73/2.42 # Proof found!
% 7.73/2.42 # SZS status Theorem
% 7.73/2.42 # SZS output start CNFRefutation
% See solution above
% 7.73/2.42 # Training examples: 0 positive, 0 negative
% 7.73/2.42
% 7.73/2.42 # -------------------------------------------------
% 7.73/2.42 # User time : 0.023 s
% 7.73/2.42 # System time : 0.006 s
% 7.73/2.42 # Total time : 0.029 s
% 7.73/2.42 # Maximum resident set size: 7124 pages
% 7.73/2.42
%------------------------------------------------------------------------------