TSTP Solution File: LCL230+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL230+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n019.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 : Sun Jul 17 10:20:48 EDT 2022
% Result : Theorem 0.20s 0.36s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 4 unt; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 30 ( 8 ~; 12 |; 4 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 4 ( 3 usr; 4 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel5,conjecture,
( ( ( p
| q )
=> ( p
| r ) )
=> ( p
| ( q
=> r ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel5) ).
fof(c_0_1,negated_conjecture,
~ ( ( ( p
| q )
=> ( p
| r ) )
=> ( p
| ( q
=> r ) ) ),
inference(assume_negation,[status(cth)],[pel5]) ).
fof(c_0_2,negated_conjecture,
( ( ~ p
| p
| r )
& ( ~ q
| p
| r )
& ~ p
& q
& ~ r ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])]) ).
cnf(c_0_3,negated_conjecture,
( p
| r
| ~ q ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
q,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
~ p,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
~ r,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4])]),c_0_5]),c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL230+1 : TPTP v8.1.0. Released v2.0.0.
% 0.13/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33 % Computer : n019.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jul 3 22:44:38 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.36 # No SInE strategy applied
% 0.20/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.20/0.36 #
% 0.20/0.36 # Presaturation interreduction done
% 0.20/0.36
% 0.20/0.36 # Proof found!
% 0.20/0.36 # SZS status Theorem
% 0.20/0.36 # SZS output start CNFRefutation
% See solution above
% 0.20/0.36 # Training examples: 0 positive, 0 negative
%------------------------------------------------------------------------------