TSTP Solution File: MSC005-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : MSC005-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n009.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 Aug 22 10:49:48 EDT 2023
% Result : Unsatisfiable 2.75s 1.67s
% Output : CNFRefutation 2.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 34 ( 15 unt; 4 typ; 0 def)
% Number of atoms : 53 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 61 ( 38 ~; 23 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 19 (; 19 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ value > xor > #nlpp > truth > falsity
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(truth,type,
truth: $i ).
tff(falsity,type,
falsity: $i ).
tff(xor,type,
xor: ( $i * $i ) > $i ).
tff(value,type,
value: ( $i * $i ) > $o ).
tff(f_22,axiom,
value(truth,truth),
file(unknown,unknown) ).
tff(f_23,axiom,
value(falsity,falsity),
file(unknown,unknown) ).
tff(f_39,axiom,
! [X,Y] :
( ~ value(X,truth)
| ~ value(Y,falsity)
| value(xor(X,Y),truth) ),
file(unknown,unknown) ).
tff(f_31,axiom,
! [X,Y] :
( ~ value(X,truth)
| ~ value(Y,truth)
| value(xor(X,Y),falsity) ),
file(unknown,unknown) ).
tff(f_47,axiom,
! [X,Y] :
( ~ value(X,falsity)
| ~ value(Y,truth)
| value(xor(X,Y),truth) ),
file(unknown,unknown) ).
tff(f_58,axiom,
! [Value] : ~ value(xor(xor(xor(xor(truth,falsity),falsity),truth),falsity),Value),
file(unknown,unknown) ).
tff(f_55,axiom,
! [X,Y] :
( ~ value(X,falsity)
| ~ value(Y,falsity)
| value(xor(X,Y),falsity) ),
file(unknown,unknown) ).
tff(c_2,plain,
value(truth,truth),
inference(cnfTransformation,[status(thm)],[f_22]) ).
tff(c_4,plain,
value(falsity,falsity),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_8,plain,
! [X_3,Y_4] :
( value(xor(X_3,Y_4),truth)
| ~ value(Y_4,falsity)
| ~ value(X_3,truth) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_6,plain,
! [X_1,Y_2] :
( value(xor(X_1,Y_2),falsity)
| ~ value(Y_2,truth)
| ~ value(X_1,truth) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_10,plain,
! [X_5,Y_6] :
( value(xor(X_5,Y_6),truth)
| ~ value(Y_6,truth)
| ~ value(X_5,falsity) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_18,plain,
! [Value_16] : ~ value(xor(xor(xor(xor(truth,falsity),falsity),truth),falsity),Value_16),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_22,plain,
( ~ value(falsity,falsity)
| ~ value(xor(xor(xor(truth,falsity),falsity),truth),truth) ),
inference(resolution,[status(thm)],[c_8,c_18]) ).
tff(c_33,plain,
~ value(xor(xor(xor(truth,falsity),falsity),truth),truth),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_22]) ).
tff(c_41,plain,
( ~ value(truth,truth)
| ~ value(xor(xor(truth,falsity),falsity),falsity) ),
inference(resolution,[status(thm)],[c_10,c_33]) ).
tff(c_45,plain,
~ value(xor(xor(truth,falsity),falsity),falsity),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_41]) ).
tff(c_49,plain,
( ~ value(falsity,truth)
| ~ value(xor(truth,falsity),truth) ),
inference(resolution,[status(thm)],[c_6,c_45]) ).
tff(c_50,plain,
~ value(xor(truth,falsity),truth),
inference(splitLeft,[status(thm)],[c_49]) ).
tff(c_79,plain,
( ~ value(falsity,falsity)
| ~ value(truth,truth) ),
inference(resolution,[status(thm)],[c_8,c_50]) ).
tff(c_86,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_4,c_79]) ).
tff(c_88,plain,
value(xor(truth,falsity),truth),
inference(splitRight,[status(thm)],[c_49]) ).
tff(c_89,plain,
! [X_19,Y_20] :
( value(xor(X_19,Y_20),falsity)
| ~ value(Y_20,falsity)
| ~ value(X_19,falsity) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_14,plain,
! [Value_9] : ~ value(xor(xor(xor(xor(truth,falsity),falsity),truth),falsity),Value_9),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_96,plain,
( ~ value(falsity,falsity)
| ~ value(xor(xor(xor(truth,falsity),falsity),truth),falsity) ),
inference(resolution,[status(thm)],[c_89,c_14]) ).
tff(c_102,plain,
~ value(xor(xor(xor(truth,falsity),falsity),truth),falsity),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_96]) ).
tff(c_120,plain,
( ~ value(truth,truth)
| ~ value(xor(xor(truth,falsity),falsity),truth) ),
inference(resolution,[status(thm)],[c_6,c_102]) ).
tff(c_124,plain,
~ value(xor(xor(truth,falsity),falsity),truth),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_120]) ).
tff(c_127,plain,
( ~ value(falsity,falsity)
| ~ value(xor(truth,falsity),truth) ),
inference(resolution,[status(thm)],[c_8,c_124]) ).
tff(c_134,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_88,c_4,c_127]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : MSC005-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.35 % Computer : n009.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 13:06:23 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.75/1.67 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.75/1.68
% 2.75/1.68 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.90/1.71
% 2.90/1.71 Inference rules
% 2.90/1.71 ----------------------
% 2.90/1.71 #Ref : 0
% 2.90/1.71 #Sup : 20
% 2.90/1.71 #Fact : 0
% 2.90/1.71 #Define : 0
% 2.90/1.71 #Split : 1
% 2.90/1.71 #Chain : 0
% 2.90/1.71 #Close : 0
% 2.90/1.71
% 2.90/1.71 Ordering : KBO
% 2.90/1.71
% 2.90/1.71 Simplification rules
% 2.90/1.71 ----------------------
% 2.90/1.71 #Subsume : 3
% 2.90/1.71 #Demod : 15
% 2.90/1.71 #Tautology : 0
% 2.90/1.71 #SimpNegUnit : 0
% 2.90/1.71 #BackRed : 0
% 2.90/1.71
% 2.90/1.71 #Partial instantiations: 0
% 2.90/1.71 #Strategies tried : 1
% 2.90/1.71
% 2.90/1.71 Timing (in seconds)
% 2.90/1.71 ----------------------
% 2.90/1.72 Preprocessing : 0.41
% 2.90/1.72 Parsing : 0.23
% 2.90/1.72 CNF conversion : 0.02
% 2.90/1.72 Main loop : 0.24
% 2.90/1.72 Inferencing : 0.10
% 2.90/1.72 Reduction : 0.06
% 2.90/1.72 Demodulation : 0.04
% 2.90/1.72 BG Simplification : 0.01
% 2.90/1.72 Subsumption : 0.05
% 2.90/1.72 Abstraction : 0.01
% 2.90/1.72 MUC search : 0.00
% 2.90/1.72 Cooper : 0.00
% 2.90/1.72 Total : 0.71
% 2.90/1.72 Index Insertion : 0.00
% 2.90/1.72 Index Deletion : 0.00
% 2.90/1.72 Index Matching : 0.00
% 2.90/1.72 BG Taut test : 0.00
%------------------------------------------------------------------------------