↑ Up

Etableau---0.67.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SEV678+1 : TPTP v9.3.0. Released v9.3.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 : n003.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 May  5 06:52:03 PM UTC 2026

% Result   : Theorem 0.39s 0.56s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SEV678+1 : TPTP v9.3.0. Released v9.3.0.
% 0.13/0.13  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.16/0.33  % Computer : n003.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit : 300
% 0.16/0.33  % WCLimit  : 300
% 0.16/0.33  % DateTime : Tue May  5 08:24:41 EDT 2026
% 0.16/0.34  % CPUTime  : 
% 0.39/0.56  # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 0.39/0.56  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.39/0.56  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.39/0.56  #
% 0.39/0.56  # Presaturation interreduction done
% 0.39/0.56  # Number of axioms: 49 Number of unprocessed: 30
% 0.39/0.56  # Tableaux proof search.
% 0.39/0.56  # APR header successfully linked.
% 0.39/0.56  # Hello from C++
% 0.39/0.56  # The folding up rule is enabled...
% 0.39/0.56  # Local unification is enabled...
% 0.39/0.56  # Any saturation attempts will use folding labels...
% 0.39/0.56  # 30 beginning clauses after preprocessing and clausification
% 0.39/0.56  # Creating start rules for all 2 conjectures.
% 0.39/0.56  # There are 2 start rule candidates:
% 0.39/0.56  # Found 10 unit axioms.
% 0.39/0.56  # Closed tableau found in foldup close cycle with 0 folds and 2 closures done.
% 0.39/0.56  # Found closed tableau while making start rule
% 0.39/0.56  # There were 0 total branch saturation attempts.
% 0.39/0.56  # There were 0 of these attempts blocked.
% 0.39/0.56  # There were 0 deferred branch saturation attempts.
% 0.39/0.56  # There were 0 free duplicated saturations.
% 0.39/0.56  # There were 0 total successful branch saturations.
% 0.39/0.56  # There were 0 successful branch saturations in interreduction.
% 0.39/0.56  # There were 0 successful branch saturations on the branch.
% 0.39/0.56  # There were 0 successful branch saturations after the branch.
% 0.39/0.56  # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.56  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.56  # Begin clausification derivation
% 0.39/0.56  
% 0.39/0.56  # End clausification derivation
% 0.39/0.56  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.39/0.56  cnf(i_0_5, plain, (cCoq_2eInit_2eDatatypes_2enat___24t(esk1_0))).
% 0.39/0.56  cnf(i_0_66, plain, (cCoq_2eInit_2eDatatypes_2enat___24t(cCoq_2eInit_2eDatatypes_2eO))).
% 0.39/0.56  cnf(i_0_68, plain, (cCoq_2eInit_2eDatatypes_2enat___24t(esk5_0))).
% 0.39/0.56  cnf(i_0_7, plain, (cProp___24t(cUseAuto_2emyFact))).
% 0.39/0.56  cnf(i_0_35, plain, (cCoq_2eInit_2ePeano_2ele___24a2(cCoq_2eInit_2eDatatypes_2eO,cCoq_2eInit_2eDatatypes_2eS___24a1(cCoq_2eInit_2eDatatypes_2eO)))).
% 0.39/0.56  cnf(i_0_4, plain, (cCoq_2eInit_2ePeano_2ele___24a2(esk1_0,cCoq_2eInit_2eDatatypes_2eS___24a1(cCoq_2eInit_2eDatatypes_2eS___24a1(cCoq_2eInit_2eDatatypes_2eS___24a1(cCoq_2eInit_2eDatatypes_2eO)))))).
% 0.39/0.56  cnf(i_0_1, negated_conjecture, (~p(cUseAuto_2emyFact))).
% 0.39/0.56  cnf(i_0_3, plain, (~cUseAuto_2eP___24a1(esk1_0))).
% 0.39/0.56  cnf(i_0_67, plain, (esk5_0!=cCoq_2eInit_2eDatatypes_2eO)).
% 0.39/0.56  cnf(i_0_50, plain, (cCoq_2eInit_2eDatatypes_2eS___24a1(X1)!=cCoq_2eInit_2eDatatypes_2eO)).
% 0.39/0.56  cnf(i_0_56, plain, (cCoq_2eInit_2eDatatypes_2eS___24a1(X1)!=X1|~cCoq_2eInit_2eDatatypes_2enat___24t(X1))).
% 0.39/0.56  cnf(i_0_2, negated_conjecture, (cUseAuto_2eP___24a1(X1)|~cCoq_2eInit_2eDatatypes_2enat___24t(X1))).
% 0.39/0.56  cnf(i_0_36, plain, (cCoq_2eInit_2ePeano_2ele___24a2(cCoq_2eInit_2eDatatypes_2eO,X1)|~cCoq_2eInit_2eDatatypes_2enat___24t(X1))).
% 0.39/0.56  cnf(i_0_51, plain, (X1=X2|cCoq_2eInit_2eDatatypes_2eS___24a1(X1)!=cCoq_2eInit_2eDatatypes_2eS___24a1(X2))).
% 0.39/0.56  cnf(i_0_31, plain, (cCoq_2eInit_2ePeano_2ele___24a2(X1,X1)|~cCoq_2eInit_2eDatatypes_2enat___24t(X1))).
% 0.39/0.56  cnf(i_0_28, plain, (cCoq_2eInit_2eDatatypes_2eO=X1|~cCoq_2eInit_2ePeano_2ele___24a2(X1,cCoq_2eInit_2eDatatypes_2eO)|~cCoq_2eInit_2eDatatypes_2enat___24t(X1))).
% 0.39/0.56  cnf(i_0_53, plain, (X1=cCoq_2eInit_2eDatatypes_2eO|cCoq_2eInit_2eDatatypes_2enat___24t(esk3_1(X1))|~cCoq_2eInit_2eDatatypes_2enat___24t(X1))).
% 0.39/0.56  cnf(i_0_63, plain, (X1=cCoq_2eInit_2eDatatypes_2eO|cCoq_2eInit_2eDatatypes_2enat___24t(esk4_1(X1))|~cCoq_2eInit_2eDatatypes_2enat___24t(X1))).
% 0.39/0.56  cnf(i_0_41, plain, (cCoq_2eInit_2ePeano_2ele___24a2(X1,cCoq_2eInit_2eDatatypes_2eS___24a1(X1))|~cCoq_2eInit_2eDatatypes_2enat___24t(X1))).
% 0.39/0.56  cnf(i_0_52, plain, (cCoq_2eInit_2eDatatypes_2eS___24a1(esk3_1(X1))=X1|X1=cCoq_2eInit_2eDatatypes_2eO|~cCoq_2eInit_2eDatatypes_2enat___24t(X1))).
% 0.39/0.56  cnf(i_0_62, plain, (cCoq_2eInit_2eDatatypes_2eS___24a1(esk4_1(X1))=X1|X1=cCoq_2eInit_2eDatatypes_2eO|~cCoq_2eInit_2eDatatypes_2enat___24t(X1))).
% 0.39/0.56  cnf(i_0_30, plain, (X1=X2|~cCoq_2eInit_2ePeano_2ele___24a2(X2,X1)|~cCoq_2eInit_2ePeano_2ele___24a2(X1,X2)|~cCoq_2eInit_2eDatatypes_2enat___24t(X2)|~cCoq_2eInit_2eDatatypes_2enat___24t(X1))).
% 0.39/0.56  cnf(i_0_38, plain, (cCoq_2eInit_2ePeano_2ele___24a2(X1,X2)|cCoq_2eInit_2ePeano_2ele___24a2(X2,X1)|~cCoq_2eInit_2eDatatypes_2enat___24t(X2)|~cCoq_2eInit_2eDatatypes_2enat___24t(X1))).
% 0.39/0.56  cnf(i_0_39, plain, (cCoq_2eInit_2ePeano_2ele___24a2(X1,cCoq_2eInit_2eDatatypes_2eS___24a1(X2))|~cCoq_2eInit_2ePeano_2ele___24a2(X1,X2)|~cCoq_2eInit_2eDatatypes_2enat___24t(X2)|~cCoq_2eInit_2eDatatypes_2enat___24t(X1))).
% 0.39/0.56  cnf(i_0_27, plain, (cCoq_2eInit_2ePeano_2ele___24a2(X1,X2)|~cCoq_2eInit_2ePeano_2ele___24a2(cCoq_2eInit_2eDatatypes_2eS___24a1(X1),cCoq_2eInit_2eDatatypes_2eS___24a1(X2))|~cCoq_2eInit_2eDatatypes_2enat___24t(X2)|~cCoq_2eInit_2eDatatypes_2enat___24t(X1))).
% 0.39/0.56  cnf(i_0_26, plain, (X1=X2|cCoq_2eInit_2eDatatypes_2enat___24t(esk2_2(X1,X2))|~cCoq_2eInit_2ePeano_2ele___24a2(X1,X2)|~cCoq_2eInit_2eDatatypes_2enat___24t(X2)|~cCoq_2eInit_2eDatatypes_2enat___24t(X1))).
% 0.39/0.56  cnf(i_0_29, plain, (cCoq_2eInit_2ePeano_2ele___24a2(cCoq_2eInit_2eDatatypes_2eS___24a1(X1),cCoq_2eInit_2eDatatypes_2eS___24a1(X2))|~cCoq_2eInit_2ePeano_2ele___24a2(X1,X2)|~cCoq_2eInit_2eDatatypes_2enat___24t(X2)|~cCoq_2eInit_2eDatatypes_2enat___24t(X1))).
% 0.39/0.56  cnf(i_0_24, plain, (cCoq_2eInit_2eDatatypes_2eS___24a1(esk2_2(X1,X2))=X2|X2=X1|~cCoq_2eInit_2ePeano_2ele___24a2(X1,X2)|~cCoq_2eInit_2eDatatypes_2enat___24t(X1)|~cCoq_2eInit_2eDatatypes_2enat___24t(X2))).
% 0.39/0.56  cnf(i_0_42, plain, (cCoq_2eInit_2ePeano_2ele___24a2(X1,X2)|~cCoq_2eInit_2ePeano_2ele___24a2(X3,X2)|~cCoq_2eInit_2ePeano_2ele___24a2(X1,X3)|~cCoq_2eInit_2eDatatypes_2enat___24t(X2)|~cCoq_2eInit_2eDatatypes_2enat___24t(X3)|~cCoq_2eInit_2eDatatypes_2enat___24t(X1))).
% 0.39/0.56  cnf(i_0_25, plain, (X1=X2|cCoq_2eInit_2ePeano_2ele___24a2(X1,esk2_2(X1,X2))|~cCoq_2eInit_2ePeano_2ele___24a2(X1,X2)|~cCoq_2eInit_2eDatatypes_2enat___24t(X2)|~cCoq_2eInit_2eDatatypes_2enat___24t(X1))).
% 0.39/0.56  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.39/0.56  # Begin printing tableau
% 0.39/0.56  # Found 3 steps
% 0.39/0.56  cnf(i_0_2, negated_conjecture, (cUseAuto_2eP___24a1(esk1_0)|~cCoq_2eInit_2eDatatypes_2enat___24t(esk1_0)), inference(start_rule)).
% 0.39/0.56  cnf(i_0_72, plain, (cUseAuto_2eP___24a1(esk1_0)), inference(closure_rule, [i_0_3])).
% 0.39/0.56  cnf(i_0_73, plain, (~cCoq_2eInit_2eDatatypes_2enat___24t(esk1_0)), inference(closure_rule, [i_0_5])).
% 0.39/0.56  # End printing tableau
% 0.39/0.56  # SZS output end
% 0.39/0.56  # Branches closed with saturation will be marked with an "s"
% 0.39/0.56  # NOT attempting initial tableau saturation
% 0.39/0.56  # 1 start rule tableaux created.
% 0.39/0.56  # 20 extension rule candidate clauses
% 0.39/0.56  # 10 unit axiom clauses
% 0.39/0.56  
% 0.39/0.56  # Proof search is over...
% 0.39/0.56  # Freeing feature tree
%------------------------------------------------------------------------------