TSTP Solution File: SET734+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET734+4 : TPTP v8.1.0. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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 : Tue Jul 19 00:13:45 EDT 2022
% Result : Theorem 9.90s 2.68s
% Output : CNFRefutation 9.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 7 unt; 0 def)
% Number of atoms : 86 ( 0 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 101 ( 37 ~; 37 |; 19 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-7 aty)
% Number of variables : 70 ( 0 sgn 43 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thII25,conjecture,
! [X6,X10,X1,X2] :
( ( maps(X10,X1,X2)
& maps(X6,X2,X1)
& identity(compose_function(X10,X6,X2,X1,X2),X2) )
=> surjective(X10,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thII25) ).
fof(identity,axiom,
! [X6,X1] :
( identity(X6,X1)
<=> ! [X3] :
( member(X3,X1)
=> apply(X6,X3,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+1.ax',identity) ).
fof(surjective,axiom,
! [X6,X1,X2] :
( surjective(X6,X1,X2)
<=> ! [X5] :
( member(X5,X2)
=> ? [X4] :
( member(X4,X1)
& apply(X6,X4,X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+1.ax',surjective) ).
fof(compose_function,axiom,
! [X10,X6,X1,X2,X11,X3,X12] :
( ( member(X3,X1)
& member(X12,X11) )
=> ( apply(compose_function(X10,X6,X1,X2,X11),X3,X12)
<=> ? [X5] :
( member(X5,X2)
& apply(X6,X3,X5)
& apply(X10,X5,X12) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+1.ax',compose_function) ).
fof(c_0_4,negated_conjecture,
~ ! [X6,X10,X1,X2] :
( ( maps(X10,X1,X2)
& maps(X6,X2,X1)
& identity(compose_function(X10,X6,X2,X1,X2),X2) )
=> surjective(X10,X1,X2) ),
inference(assume_negation,[status(cth)],[thII25]) ).
fof(c_0_5,plain,
! [X113,X114,X115,X116,X117] :
( ( ~ identity(X113,X114)
| ~ member(X115,X114)
| apply(X113,X115,X115) )
& ( member(esk17_2(X116,X117),X117)
| identity(X116,X117) )
& ( ~ apply(X116,esk17_2(X116,X117),esk17_2(X116,X117))
| identity(X116,X117) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[identity])])])])])]) ).
fof(c_0_6,negated_conjecture,
( maps(esk42_0,esk43_0,esk44_0)
& maps(esk41_0,esk44_0,esk43_0)
& identity(compose_function(esk42_0,esk41_0,esk44_0,esk43_0,esk44_0),esk44_0)
& ~ surjective(esk42_0,esk43_0,esk44_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
! [X131,X132,X133,X134,X136,X137,X138,X140] :
( ( member(esk21_4(X131,X132,X133,X134),X132)
| ~ member(X134,X133)
| ~ surjective(X131,X132,X133) )
& ( apply(X131,esk21_4(X131,X132,X133,X134),X134)
| ~ member(X134,X133)
| ~ surjective(X131,X132,X133) )
& ( member(esk22_3(X136,X137,X138),X138)
| surjective(X136,X137,X138) )
& ( ~ member(X140,X137)
| ~ apply(X136,X140,esk22_3(X136,X137,X138))
| surjective(X136,X137,X138) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[surjective])])])])])]) ).
cnf(c_0_8,plain,
( apply(X1,X3,X3)
| ~ identity(X1,X2)
| ~ member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
identity(compose_function(esk42_0,esk41_0,esk44_0,esk43_0,esk44_0),esk44_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
~ surjective(esk42_0,esk43_0,esk44_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( member(esk22_3(X1,X2,X3),X3)
| surjective(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X90,X91,X92,X93,X94,X95,X96,X98] :
( ( member(esk13_7(X90,X91,X92,X93,X94,X95,X96),X93)
| ~ apply(compose_function(X90,X91,X92,X93,X94),X95,X96)
| ~ member(X95,X92)
| ~ member(X96,X94) )
& ( apply(X91,X95,esk13_7(X90,X91,X92,X93,X94,X95,X96))
| ~ apply(compose_function(X90,X91,X92,X93,X94),X95,X96)
| ~ member(X95,X92)
| ~ member(X96,X94) )
& ( apply(X90,esk13_7(X90,X91,X92,X93,X94,X95,X96),X96)
| ~ apply(compose_function(X90,X91,X92,X93,X94),X95,X96)
| ~ member(X95,X92)
| ~ member(X96,X94) )
& ( ~ member(X98,X93)
| ~ apply(X91,X95,X98)
| ~ apply(X90,X98,X96)
| apply(compose_function(X90,X91,X92,X93,X94),X95,X96)
| ~ member(X95,X92)
| ~ member(X96,X94) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[compose_function])])])])]) ).
cnf(c_0_13,negated_conjecture,
( apply(compose_function(esk42_0,esk41_0,esk44_0,esk43_0,esk44_0),X1,X1)
| ~ member(X1,esk44_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
member(esk22_3(esk42_0,esk43_0,esk44_0),esk44_0),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( apply(X1,esk13_7(X1,X2,X3,X4,X5,X6,X7),X7)
| ~ apply(compose_function(X1,X2,X3,X4,X5),X6,X7)
| ~ member(X6,X3)
| ~ member(X7,X5) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
apply(compose_function(esk42_0,esk41_0,esk44_0,esk43_0,esk44_0),esk22_3(esk42_0,esk43_0,esk44_0),esk22_3(esk42_0,esk43_0,esk44_0)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( member(esk13_7(X1,X2,X3,X4,X5,X6,X7),X4)
| ~ apply(compose_function(X1,X2,X3,X4,X5),X6,X7)
| ~ member(X6,X3)
| ~ member(X7,X5) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( surjective(X3,X2,X4)
| ~ member(X1,X2)
| ~ apply(X3,X1,esk22_3(X3,X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,negated_conjecture,
apply(esk42_0,esk13_7(esk42_0,esk41_0,esk44_0,esk43_0,esk44_0,esk22_3(esk42_0,esk43_0,esk44_0),esk22_3(esk42_0,esk43_0,esk44_0)),esk22_3(esk42_0,esk43_0,esk44_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_14])]) ).
cnf(c_0_20,negated_conjecture,
member(esk13_7(esk42_0,esk41_0,esk44_0,esk43_0,esk44_0,esk22_3(esk42_0,esk43_0,esk44_0),esk22_3(esk42_0,esk43_0,esk44_0)),esk43_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_16]),c_0_14])]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET734+4 : TPTP v8.1.0. Bugfixed v2.2.1.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n025.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 : Sat Jul 9 20:37:17 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.44 # ENIGMATIC: Selected SinE mode:
% 0.20/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.90/2.68 # ENIGMATIC: Solved by autoschedule:
% 9.90/2.68 # No SInE strategy applied
% 9.90/2.68 # Trying AutoSched0 for 150 seconds
% 9.90/2.68 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S01DA
% 9.90/2.68 # and selection function PSelectMinOptimalNoRXTypePred.
% 9.90/2.68 #
% 9.90/2.68 # Preprocessing time : 0.036 s
% 9.90/2.68 # Presaturation interreduction done
% 9.90/2.68
% 9.90/2.68 # Proof found!
% 9.90/2.68 # SZS status Theorem
% 9.90/2.68 # SZS output start CNFRefutation
% See solution above
% 9.90/2.68 # Training examples: 0 positive, 0 negative
% 9.90/2.68
% 9.90/2.68 # -------------------------------------------------
% 9.90/2.68 # User time : 0.321 s
% 9.90/2.68 # System time : 0.026 s
% 9.90/2.68 # Total time : 0.346 s
% 9.90/2.68 # Maximum resident set size: 7116 pages
% 9.90/2.68
%------------------------------------------------------------------------------