TSTP Solution File: SWV997_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV997_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 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 : 300s
% DateTime : Tue Aug 22 11:06:05 EDT 2023
% Result : Theorem 3.92s 1.98s
% Output : CNFRefutation 3.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 13 unt; 7 typ; 0 def)
% Number of atoms : 103 ( 72 equ)
% Maximal formula atoms : 54 ( 4 avg)
% Number of connectives : 129 ( 47 ~; 29 |; 52 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 101 ( 29 atm; 0 fun; 47 num; 25 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 0 usr; 2 prp; 0-2 aty)
% Number of functors : 16 ( 7 usr; 14 con; 0-1 aty)
% Number of variables : 25 (; 25 !; 0 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > b > a
%Foreground sorts:
%Background operators:
tff(z3,type,
z3: $int ).
tff('#skE_1',type,
'#skE_1': $int ).
tff(z1,type,
z1: $int ).
tff(z4,type,
z4: $int ).
tff(z2,type,
z2: $int ).
%Foreground operators:
tff(b,type,
b: $int > $int ).
tff(a,type,
a: $int > $int ).
tff(f_174,negated_conjecture,
~ ( ( ! [Z1a: $int] :
( $lesseq(1,a(Z1a))
& $lesseq(a(Z1a),12) )
& ! [Z1a: $int] :
( $lesseq(1,b(Z1a))
& $lesseq(b(Z1a),5) )
& $true
& ( z1 != z2 )
& ( z1 != z3 )
& ( z1 != z4 )
& ( z2 != z3 )
& ( z2 != z4 )
& ( z3 != z4 )
& ! [Z1a: $int,Z2a: $int] :
~ ( ( Z1a != Z2a )
& ( a(Z1a) = 10 )
& ( a(Z2a) = 10 ) )
& ! [Z1a: $int,Z2a: $int] :
~ ( ( Z1a != Z2a )
& ( a(Z1a) = 9 )
& ( a(Z2a) = 10 )
& $less(b(Z2a),3)
& $less(Z2a,Z1a) )
& ! [Z1a: $int,Z2a: $int] :
~ ( ( Z1a != Z2a )
& ( a(Z1a) = 8 )
& ( a(Z2a) = 10 )
& $less(b(Z2a),3)
& $less(Z2a,Z1a) )
& ! [Z1a: $int,Z2a: $int,Z3a: $int] :
~ ( ( Z1a != Z2a )
& ( Z1a != Z3a )
& ( Z2a != Z3a )
& ( a(Z1a) = 7 )
& ( a(Z2a) = 10 )
& $less(b(Z2a),3)
& ( b(Z3a) = 5 )
& $less(Z2a,Z1a) )
& ! [Z1a: $int,Z2a: $int,Z3a: $int] :
~ ( ( Z1a != Z2a )
& ( Z1a != Z3a )
& ( Z2a != Z3a )
& ( a(Z1a) = 6 )
& ( a(Z2a) = 10 )
& $less(b(Z2a),3)
& ( b(Z3a) = 5 )
& $less(Z2a,Z1a) )
& ! [Z1a: $int,Z2a: $int,Z3a: $int] :
~ ( ( Z1a != Z2a )
& ( Z1a != Z3a )
& ( Z2a != Z3a )
& ( a(Z1a) = 7 )
& ( a(Z2a) = 10 )
& ( a(Z3a) = 8 )
& $less(b(Z2a),3)
& $less(Z2a,Z1a) ) )
=> ~ ( ( a(z1) = 6 )
& ( a(z2) = 10 )
& ( a(z3) = 1 )
& $less(b(z2),3)
& ( b(z3) = 5 )
& $less(z2,z1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',0) ).
tff(c_41,plain,
z3 != z1,
inference(cnfTransformation,[status(thm)],[f_174]) ).
tff(c_40,plain,
z2 != z1,
inference(cnfTransformation,[status(thm)],[f_174]) ).
tff(c_72,plain,
$less(z2,z1),
inference(cnfTransformation,[status(thm)],[f_174]) ).
tff(c_55,plain,
a(z1) = 6,
inference(cnfTransformation,[status(thm)],[f_174]) ).
tff(c_43,plain,
z3 != z2,
inference(cnfTransformation,[status(thm)],[f_174]) ).
tff(c_76,plain,
a(z2) = 10,
inference(cnfTransformation,[status(thm)],[f_174]) ).
tff(c_67,plain,
$less(b(z2),3),
inference(cnfTransformation,[status(thm)],[f_174]) ).
tff(c_168,plain,
b(z2) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_67]) ).
tff(c_80,plain,
$less(b(z2),3),
inference(cnfTransformation,[status(thm)],[f_174]) ).
tff(c_175,plain,
$less('#skE_1',3),
inference(demodulation,[status(thm),theory(equality)],[c_168,c_80]) ).
tff(c_174,plain,
b(z2) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_67]) ).
tff(c_71,plain,
b(z3) = 5,
inference(cnfTransformation,[status(thm)],[f_174]) ).
tff(c_442,plain,
! [Z3_59a: $int,Z2_60a: $int,Z1_61a: $int] :
( ( b(Z3_59a) != 5 )
| ~ $less(b(Z2_60a),3)
| ( a(Z2_60a) != 10 )
| ( a(Z1_61a) != 6 )
| ( Z2_60a = Z1_61a )
| ( Z3_59a = Z1_61a )
| ( Z3_59a = Z2_60a )
| ~ $less(Z2_60a,Z1_61a) ),
inference(cnfTransformation,[status(thm)],[f_174]) ).
tff(c_451,plain,
! [Z2_62a: $int,Z1_63a: $int] :
( ~ $less(b(Z2_62a),3)
| ( a(Z2_62a) != 10 )
| ( a(Z1_63a) != 6 )
| ( Z2_62a = Z1_63a )
| ( z3 = Z1_63a )
| ( z3 = Z2_62a )
| ~ $less(Z2_62a,Z1_63a) ),
inference(superposition,[status(thm),theory(equality)],[c_71,c_442]) ).
tff(c_454,plain,
! [Z1_63a: $int] :
( ~ $less('#skE_1',3)
| ( a(z2) != 10 )
| ( a(Z1_63a) != 6 )
| ( z2 = Z1_63a )
| ( z3 = Z1_63a )
| ( z3 = z2 )
| ~ $less(z2,Z1_63a) ),
inference(superposition,[status(thm),theory(equality)],[c_174,c_451]) ).
tff(c_460,plain,
! [Z1_63a: $int] :
( ( a(Z1_63a) != 6 )
| ( z2 = Z1_63a )
| ( z3 = Z1_63a )
| ( z3 = z2 )
| ~ $less(z2,Z1_63a) ),
inference(demodulation,[status(thm),theory(equality)],[c_76,c_175,c_454]) ).
tff(c_467,plain,
! [Z1_64a: $int] :
( ( a(Z1_64a) != 6 )
| ( z2 = Z1_64a )
| ( z3 = Z1_64a )
| ~ $less(z2,Z1_64a) ),
inference(negUnitSimplification,[status(thm)],[c_43,c_460]) ).
tff(c_476,plain,
( ( z2 = z1 )
| ( z3 = z1 )
| ~ $less(z2,z1) ),
inference(superposition,[status(thm),theory(equality)],[c_55,c_467]) ).
tff(c_485,plain,
( ( z2 = z1 )
| ( z3 = z1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_72,c_476]) ).
tff(c_487,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_41,c_40,c_485]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWV997_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.15 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.15/0.37 % Computer : n018.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 22:51:51 EDT 2023
% 0.15/0.37 % CPUTime :
% 3.92/1.98 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.92/1.98
% 3.92/1.98 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.92/2.00
% 3.92/2.00 Inference rules
% 3.92/2.00 ----------------------
% 3.92/2.01 #Ref : 0
% 3.92/2.01 #Sup : 63
% 3.92/2.01 #Fact : 0
% 3.92/2.01 #Define : 1
% 3.92/2.01 #Split : 0
% 3.92/2.01 #Chain : 0
% 3.92/2.01 #Close : 0
% 3.92/2.01
% 3.92/2.01 Ordering : LPO
% 3.92/2.01
% 3.92/2.01 Simplification rules
% 3.92/2.01 ----------------------
% 3.92/2.01 #Subsume : 8
% 3.92/2.01 #Demod : 20
% 3.92/2.01 #Tautology : 42
% 3.92/2.01 #SimpNegUnit : 6
% 3.92/2.01 #BackRed : 0
% 3.92/2.01
% 3.92/2.01 #Partial instantiations: 0
% 3.92/2.01 #Strategies tried : 1
% 3.92/2.01
% 3.92/2.01 Timing (in seconds)
% 3.92/2.01 ----------------------
% 3.92/2.01 Preprocessing : 0.58
% 3.92/2.01 Parsing : 0.31
% 3.92/2.01 CNF conversion : 0.03
% 3.92/2.01 Main loop : 0.35
% 3.92/2.01 Inferencing : 0.09
% 3.92/2.01 Reduction : 0.09
% 3.92/2.01 Demodulation : 0.06
% 3.92/2.01 BG Simplification : 0.06
% 3.92/2.01 Subsumption : 0.07
% 3.92/2.01 Abstraction : 0.01
% 3.92/2.01 MUC search : 0.00
% 3.92/2.01 Cooper : 0.04
% 3.92/2.01 Total : 0.98
% 3.92/2.01 Index Insertion : 0.00
% 3.92/2.01 Index Deletion : 0.00
% 3.92/2.01 Index Matching : 0.00
% 3.92/2.01 BG Taut test : 0.00
%------------------------------------------------------------------------------