%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : PUZ132+1 : TPTP v9.2.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n006.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 : 300s
% DateTime : Tue May 5 05:03:41 PM UTC 2026
% Result : Theorem 1.25s 1.71s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 23 ( 10 unt; 0 def)
% Number of atoms : 36 ( 2 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 26 ( 13 ~; 8 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 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 : 9 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(washington_conjecture,conjecture,
( beautiful(washington)
& has_crime(washington) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',washington_conjecture) ).
fof(beautiful_capital_axiom,axiom,
! [X2] :
( country(X2)
=> beautiful(capital_city(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',beautiful_capital_axiom) ).
fof(usa_capital_axiom,axiom,
capital_city(usa) = washington,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',usa_capital_axiom) ).
fof(usa_type,axiom,
country(usa),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',usa_type) ).
fof(crime_axiom,axiom,
! [X2] :
( city(X2)
=> has_crime(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',crime_axiom) ).
fof(capital_city_type,axiom,
! [X1] :
( capital(X1)
=> city(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',capital_city_type) ).
fof(washington_type,axiom,
capital(washington),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',washington_type) ).
fof(c_0_7,negated_conjecture,
~ ( beautiful(washington)
& has_crime(washington) ),
inference(assume_negation,[status(cth)],[washington_conjecture]) ).
fof(c_0_8,plain,
! [X16] :
( ~ country(X16)
| beautiful(capital_city(X16)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[beautiful_capital_axiom])]) ).
fof(c_0_9,negated_conjecture,
( ~ beautiful(washington)
| ~ has_crime(washington) ),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( beautiful(capital_city(X1))
| ~ country(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
capital_city(usa) = washington,
inference(split_conjunct,[status(thm)],[usa_capital_axiom]) ).
cnf(c_0_12,plain,
country(usa),
inference(split_conjunct,[status(thm)],[usa_type]) ).
cnf(c_0_13,negated_conjecture,
( ~ beautiful(washington)
| ~ has_crime(washington) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
beautiful(washington),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
fof(c_0_15,plain,
! [X15] :
( ~ city(X15)
| has_crime(X15) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[crime_axiom])]) ).
cnf(c_0_16,negated_conjecture,
~ has_crime(washington),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_17,plain,
( has_crime(X1)
| ~ city(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X12] :
( ~ capital(X12)
| city(X12) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[capital_city_type])]) ).
cnf(c_0_19,negated_conjecture,
~ city(washington),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( city(X1)
| ~ capital(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
capital(washington),
inference(split_conjunct,[status(thm)],[washington_type]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PUZ132+1 : TPTP v9.2.1. Released v4.1.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n006.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 01:36:31 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.25/1.71 % Version : CSE_E---1.7
% 1.25/1.71 % Problem : theBenchmark.p
% 1.25/1.71 % SZS status Theorem for theBenchmark.p
% 1.25/1.71 % SZS output start CNFRefutation
% See solution above
% 1.25/1.71 % Total time : 1.368s
%------------------------------------------------------------------------------