TSTP Solution File: CSR051+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR051+4 : TPTP v8.1.0. Released v3.4.0.
% 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 : Fri Jul 15 02:47:03 EDT 2022
% Result : Theorem 6.27s 3.78s
% Output : CNFRefutation 6.27s
% 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_700,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w2yqwtj2/lgb.p',i_0_700) ).
cnf(i_0_2693,negated_conjecture,
mtvisible(c_tptp_member3356_mt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w2yqwtj2/lgb.p',i_0_2693) ).
cnf(i_0_2692,negated_conjecture,
~ marriagelicensedocument(X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-w2yqwtj2/lgb.p',i_0_2692) ).
cnf(c_0_2697,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
i_0_700 ).
cnf(c_0_2698,negated_conjecture,
mtvisible(c_tptp_member3356_mt),
i_0_2693 ).
cnf(c_0_2699,negated_conjecture,
~ marriagelicensedocument(X1),
i_0_2692 ).
cnf(c_0_2700,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2697,c_0_2698])]),c_0_2699]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : CSR051+4 : TPTP v8.1.0. Released v3.4.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 9 17:29:52 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.90/1.12 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.90/1.12 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.90/1.12 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.90/1.12 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.27/3.78 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.27/3.78 # No SInE strategy applied
% 6.27/3.78 # Trying AutoSched0 for 150 seconds
% 6.27/3.78 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 6.27/3.78 # and selection function SelectCQPrecWNTNp.
% 6.27/3.78 #
% 6.27/3.78 # Preprocessing time : 0.023 s
% 6.27/3.78
% 6.27/3.78 # Proof found!
% 6.27/3.78 # SZS status Theorem
% 6.27/3.78 # SZS output start CNFRefutation
% See solution above
% 6.27/3.78 # Training examples: 0 positive, 0 negative
% 6.27/3.78
% 6.27/3.78 # -------------------------------------------------
% 6.27/3.78 # User time : 0.024 s
% 6.27/3.78 # System time : 0.005 s
% 6.27/3.78 # Total time : 0.029 s
% 6.27/3.78 # Maximum resident set size: 7128 pages
% 6.27/3.78
%------------------------------------------------------------------------------