TSTP Solution File: CSR051+6 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR051+6 : TPTP v8.1.0. Bugfixed v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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 : Fri Jul 15 02:47:03 EDT 2022
% Result : Theorem 71.53s 65.47s
% Output : CNFRefutation 71.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 9 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 2 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1998,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pebyhl2a/lgb.p',i_0_1998) ).
cnf(i_0_3471,negated_conjecture,
mtvisible(c_tptp_member3356_mt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pebyhl2a/lgb.p',i_0_3471) ).
cnf(i_0_3470,negated_conjecture,
~ marriagelicensedocument(X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pebyhl2a/lgb.p',i_0_3470) ).
cnf(c_0_3475,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
i_0_1998 ).
cnf(c_0_3476,negated_conjecture,
mtvisible(c_tptp_member3356_mt),
i_0_3471 ).
cnf(c_0_3477,negated_conjecture,
~ marriagelicensedocument(X1),
i_0_3470 ).
cnf(c_0_3478,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3475,c_0_3476])]),c_0_3477]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR051+6 : TPTP v8.1.0. Bugfixed v5.3.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 11 13:48:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected SinE mode:
% 62.24/62.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 62.24/62.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 62.24/62.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 62.24/62.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 71.53/65.47 # ENIGMATIC: Solved by autoschedule-lgb:
% 71.53/65.47 # No SInE strategy applied
% 71.53/65.47 # Trying AutoSched0 for 119 seconds
% 71.53/65.47 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 71.53/65.47 # and selection function SelectComplexExceptUniqMaxHorn.
% 71.53/65.47 #
% 71.53/65.47 # Preprocessing time : 0.027 s
% 71.53/65.47 # Presaturation interreduction done
% 71.53/65.47
% 71.53/65.47 # Proof found!
% 71.53/65.47 # SZS status Theorem
% 71.53/65.47 # SZS output start CNFRefutation
% See solution above
% 71.53/65.47 # Training examples: 0 positive, 0 negative
% 71.53/65.47
% 71.53/65.47 # -------------------------------------------------
% 71.53/65.47 # User time : 0.029 s
% 71.53/65.47 # System time : 0.004 s
% 71.53/65.47 # Total time : 0.033 s
% 71.53/65.47 # Maximum resident set size: 7124 pages
% 71.53/65.47
%------------------------------------------------------------------------------