TSTP Solution File: SWV001-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWV001-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n013.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 : Thu Aug 31 21:36:04 EDT 2023
% Result : Unsatisfiable 0.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 18
% Syntax : Number of formulae : 34 ( 8 unt; 9 typ; 0 def)
% Number of atoms : 56 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 63 ( 32 ~; 31 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 6 >; 10 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 40 ( 6 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
equalish: ( $i * $i ) > $o ).
tff(decl_23,type,
less_or_equalish: ( $i * $i ) > $o ).
tff(decl_24,type,
q1: ( $i * $i * $i ) > $o ).
tff(decl_25,type,
q2: ( $i * $i * $i ) > $o ).
tff(decl_26,type,
q3: ( $i * $i * $i ) > $o ).
tff(decl_27,type,
q4: ( $i * $i * $i ) > $o ).
tff(decl_28,type,
a: $i ).
tff(decl_29,type,
b: $i ).
tff(decl_30,type,
c: $i ).
cnf(clause_3,axiom,
( q4(X1,X2,X2)
| ~ q2(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_1,axiom,
( q2(X1,X2,X3)
| ~ q1(X1,X2,X3)
| ~ less_or_equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_5,negated_conjecture,
q1(a,b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_4,axiom,
( q4(X1,X2,X1)
| ~ q3(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_2,axiom,
( less_or_equalish(X1,X2)
| q3(X1,X2,X3)
| ~ q1(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_7,negated_conjecture,
( ~ q4(a,b,X1)
| ~ less_or_equalish(a,X1)
| ~ less_or_equalish(b,X1)
| ~ less_or_equalish(X1,b) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
cnf(less_or_equal_reflexivity,axiom,
less_or_equalish(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_reflexivity) ).
cnf(clause_6,negated_conjecture,
( ~ q4(a,b,X1)
| ~ less_or_equalish(a,X1)
| ~ less_or_equalish(b,X1)
| ~ less_or_equalish(X1,a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(all_less_or_equal,axiom,
( less_or_equalish(X1,X2)
| less_or_equalish(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',all_less_or_equal) ).
cnf(c_0_9,axiom,
( q4(X1,X2,X2)
| ~ q2(X1,X2,X3) ),
clause_3 ).
cnf(c_0_10,axiom,
( q2(X1,X2,X3)
| ~ q1(X1,X2,X3)
| ~ less_or_equalish(X1,X2) ),
clause_1 ).
cnf(c_0_11,plain,
( q4(X1,X2,X2)
| ~ q1(X1,X2,X3)
| ~ less_or_equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
q1(a,b,c),
clause_5 ).
cnf(c_0_13,axiom,
( q4(X1,X2,X1)
| ~ q3(X1,X2,X3) ),
clause_4 ).
cnf(c_0_14,axiom,
( less_or_equalish(X1,X2)
| q3(X1,X2,X3)
| ~ q1(X1,X2,X3) ),
clause_2 ).
cnf(c_0_15,negated_conjecture,
( ~ q4(a,b,X1)
| ~ less_or_equalish(a,X1)
| ~ less_or_equalish(b,X1)
| ~ less_or_equalish(X1,b) ),
clause_7 ).
cnf(c_0_16,negated_conjecture,
( q4(a,b,b)
| ~ less_or_equalish(a,b) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,axiom,
less_or_equalish(X1,X1),
less_or_equal_reflexivity ).
cnf(c_0_18,plain,
( q4(X1,X2,X1)
| less_or_equalish(X1,X2)
| ~ q1(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
~ less_or_equalish(a,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_20,negated_conjecture,
( ~ q4(a,b,X1)
| ~ less_or_equalish(a,X1)
| ~ less_or_equalish(b,X1)
| ~ less_or_equalish(X1,a) ),
clause_6 ).
cnf(c_0_21,negated_conjecture,
q4(a,b,a),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_12]),c_0_19]) ).
cnf(c_0_22,negated_conjecture,
~ less_or_equalish(b,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_17])]) ).
cnf(c_0_23,axiom,
( less_or_equalish(X1,X2)
| less_or_equalish(X2,X1) ),
all_less_or_equal ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV001-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n013.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 : 300
% 0.13/0.34 % DateTime : Tue Aug 29 04:28:16 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 0.19/0.58 % Version : CSE_E---1.5
% 0.19/0.58 % Problem : theBenchmark.p
% 0.19/0.58 % Proof found
% 0.19/0.58 % SZS status Theorem for theBenchmark.p
% 0.19/0.58 % SZS output start Proof
% See solution above
% 0.19/0.58 % Total time : 0.005000 s
% 0.19/0.58 % SZS output end Proof
% 0.19/0.58 % Total time : 0.007000 s
%------------------------------------------------------------------------------