TSTP Solution File: KRS102+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KRS102+1 : TPTP v8.1.0. Released v3.1.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 : n021.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 03:00:33 EDT 2022
% Result : Unsatisfiable 2.02s 0.63s
% Output : CNFRefutation 2.02s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : KRS102+1 : TPTP v8.1.0. Released v3.1.0.
% 0.08/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.34 % Computer : n021.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 : Tue Jun 7 18:33:51 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 79 Number of unprocessed: 79
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # Hello from C++
% 0.12/0.38 # The folding up rule is enabled...
% 0.12/0.38 # Local unification is enabled...
% 0.12/0.38 # Any saturation attempts will use folding labels...
% 0.12/0.38 # 79 beginning clauses after preprocessing and clausification
% 0.12/0.38 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.12/0.38 # No conjectures.
% 0.12/0.38 # There are 79 start rule candidates:
% 0.12/0.38 # Found 22 unit axioms.
% 0.12/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.38 # 79 start rule tableaux created.
% 0.12/0.38 # 57 extension rule candidate clauses
% 0.12/0.38 # 22 unit axiom clauses
% 0.12/0.38
% 0.12/0.38 # Requested 8, 32 cores available to the main process.
% 1.71/0.59 # Creating equality axioms
% 1.71/0.59 # Ran out of tableaux, making start rules for all clauses
% 1.71/0.59 # Creating equality axioms
% 1.71/0.59 # Ran out of tableaux, making start rules for all clauses
% 1.71/0.60 # Creating equality axioms
% 1.71/0.60 # Ran out of tableaux, making start rules for all clauses
% 1.71/0.60 # Creating equality axioms
% 1.71/0.60 # Ran out of tableaux, making start rules for all clauses
% 1.86/0.60 # Creating equality axioms
% 1.86/0.60 # Ran out of tableaux, making start rules for all clauses
% 1.86/0.60 # Creating equality axioms
% 1.86/0.60 # Ran out of tableaux, making start rules for all clauses
% 1.86/0.62 # Creating equality axioms
% 1.86/0.62 # Ran out of tableaux, making start rules for all clauses
% 2.02/0.63 # There were 2 total branch saturation attempts.
% 2.02/0.63 # There were 0 of these attempts blocked.
% 2.02/0.63 # There were 0 deferred branch saturation attempts.
% 2.02/0.63 # There were 0 free duplicated saturations.
% 2.02/0.63 # There were 2 total successful branch saturations.
% 2.02/0.63 # There were 0 successful branch saturations in interreduction.
% 2.02/0.63 # There were 0 successful branch saturations on the branch.
% 2.02/0.63 # There were 2 successful branch saturations after the branch.
% 2.02/0.63 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.02/0.63 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.02/0.63 # Begin clausification derivation
% 2.02/0.63
% 2.02/0.63 # End clausification derivation
% 2.02/0.63 # Begin listing active clauses obtained from FOF to CNF conversion
% 2.02/0.63 cnf(i_0_11, plain, (cTorF(iplus1))).
% 2.02/0.63 cnf(i_0_10, plain, (cTorF(iminus1))).
% 2.02/0.63 cnf(i_0_14, plain, (cTorF(iminus4))).
% 2.02/0.63 cnf(i_0_13, plain, (cTorF(iplus4))).
% 2.02/0.63 cnf(i_0_17, plain, (cTorF(iplus2))).
% 2.02/0.63 cnf(i_0_16, plain, (cTorF(iminus2))).
% 2.02/0.63 cnf(i_0_20, plain, (cTorF(iplus7))).
% 2.02/0.63 cnf(i_0_19, plain, (cTorF(iminus7))).
% 2.02/0.63 cnf(i_0_23, plain, (cTorF(iplus5))).
% 2.02/0.63 cnf(i_0_22, plain, (cTorF(iminus5))).
% 2.02/0.63 cnf(i_0_26, plain, (cTorF(iplus3))).
% 2.02/0.63 cnf(i_0_25, plain, (cTorF(iminus3))).
% 2.02/0.63 cnf(i_0_29, plain, (cTorF(iT))).
% 2.02/0.63 cnf(i_0_28, plain, (cTorF(iF))).
% 2.02/0.63 cnf(i_0_32, plain, (cTorF(iplus8))).
% 2.02/0.63 cnf(i_0_31, plain, (cTorF(iminus8))).
% 2.02/0.63 cnf(i_0_35, plain, (cTorF(iminus6))).
% 2.02/0.63 cnf(i_0_34, plain, (cTorF(iplus6))).
% 2.02/0.63 cnf(i_0_38, plain, (cTorF(iminus9))).
% 2.02/0.63 cnf(i_0_37, plain, (cTorF(iplus9))).
% 2.02/0.63 cnf(i_0_105, plain, (iF!=iT)).
% 2.02/0.63 cnf(i_0_6, plain, (~cowlNothing(X1))).
% 2.02/0.63 cnf(i_0_9, plain, (~xsd_string(X1)|~xsd_integer(X1))).
% 2.02/0.63 cnf(i_0_80, plain, (iplus2=iT|iminus4=iT|iplus1=iT)).
% 2.02/0.63 cnf(i_0_57, plain, (iminus6=iT|iminus4=iT|iplus1=iT)).
% 2.02/0.63 cnf(i_0_58, plain, (iplus9=iT|iminus4=iT|iplus1=iT)).
% 2.02/0.63 cnf(i_0_51, plain, (iplus7=iT|iplus4=iT|iplus1=iT)).
% 2.02/0.63 cnf(i_0_69, plain, (iplus3=iT|iplus4=iT|iplus1=iT)).
% 2.02/0.63 cnf(i_0_41, plain, (iminus6=iT|iplus2=iT|iplus1=iT)).
% 2.02/0.63 cnf(i_0_66, plain, (iminus3=iT|iminus2=iT|iplus1=iT)).
% 2.02/0.63 cnf(i_0_47, plain, (iminus9=iT|iminus6=iT|iplus1=iT)).
% 2.02/0.63 cnf(i_0_45, plain, (iplus9=iT|iminus6=iT|iplus1=iT)).
% 2.02/0.63 cnf(i_0_81, plain, (iplus6=iT|iminus4=iT|iminus1=iT)).
% 2.02/0.63 cnf(i_0_65, plain, (iplus2=iT|iplus4=iT|iminus1=iT)).
% 2.02/0.63 cnf(i_0_59, plain, (iplus8=iT|iplus2=iT|iminus4=iT)).
% 2.02/0.63 cnf(i_0_86, plain, (iplus9=iT|iplus7=iT|iminus4=iT)).
% 2.02/0.63 cnf(i_0_64, plain, (iminus3=iT|iminus7=iT|iminus4=iT)).
% 2.02/0.63 cnf(i_0_60, plain, (iplus9=iT|iplus5=iT|iminus4=iT)).
% 2.02/0.63 cnf(i_0_67, plain, (iplus6=iT|iplus3=iT|iminus4=iT)).
% 2.02/0.63 cnf(i_0_56, plain, (iplus6=iT|iminus3=iT|iminus4=iT)).
% 2.02/0.63 cnf(i_0_85, plain, (iplus6=iT|iplus8=iT|iminus4=iT)).
% 2.02/0.63 cnf(i_0_68, plain, (iminus9=iT|iminus8=iT|iminus4=iT)).
% 2.02/0.63 cnf(i_0_8, plain, (xsd_string(X1)|xsd_integer(X1))).
% 2.02/0.63 cnf(i_0_12, plain, (X1=iminus1|X1=iplus1|~cTorF(X1))).
% 2.02/0.63 cnf(i_0_15, plain, (X1=iplus4|X1=iminus4|~cTorF(X1))).
% 2.02/0.63 cnf(i_0_18, plain, (X1=iminus2|X1=iplus2|~cTorF(X1))).
% 2.02/0.63 cnf(i_0_49, plain, (iplus9=iT|iminus8=iT|iminus4=iT)).
% 2.02/0.63 cnf(i_0_84, plain, (iminus6=iT|iminus2=iT|iplus4=iT)).
% 2.02/0.63 cnf(i_0_61, plain, (iplus6=iT|iminus5=iT|iplus4=iT)).
% 2.02/0.63 cnf(i_0_50, plain, (iplus6=iT|iplus3=iT|iplus4=iT)).
% 2.02/0.63 cnf(i_0_46, plain, (iminus9=iT|iplus3=iT|iplus4=iT)).
% 2.02/0.63 cnf(i_0_74, plain, (iplus9=iT|iplus3=iT|iplus4=iT)).
% 2.02/0.63 cnf(i_0_53, plain, (iplus6=iT|iminus8=iT|iplus4=iT)).
% 2.02/0.63 cnf(i_0_21, plain, (X1=iminus7|X1=iplus7|~cTorF(X1))).
% 2.02/0.63 cnf(i_0_24, plain, (X1=iminus5|X1=iplus5|~cTorF(X1))).
% 2.02/0.63 cnf(i_0_27, plain, (X1=iminus3|X1=iplus3|~cTorF(X1))).
% 2.02/0.63 cnf(i_0_30, plain, (X1=iF|X1=iT|~cTorF(X1))).
% 2.02/0.63 cnf(i_0_78, plain, (iminus5=iT|iminus7=iT|iplus2=iT)).
% 2.02/0.63 cnf(i_0_83, plain, (iplus9=iT|iplus5=iT|iplus2=iT)).
% 2.02/0.63 cnf(i_0_70, plain, (iplus8=iT|iminus3=iT|iplus2=iT)).
% 2.02/0.63 cnf(i_0_76, plain, (iminus9=iT|iplus7=iT|iminus2=iT)).
% 2.02/0.63 cnf(i_0_55, plain, (iplus6=iT|iminus7=iT|iminus2=iT)).
% 2.02/0.63 cnf(i_0_63, plain, (iminus9=iT|iminus5=iT|iminus2=iT)).
% 2.02/0.63 cnf(i_0_52, plain, (iminus8=iT|iplus3=iT|iminus2=iT)).
% 2.02/0.63 cnf(i_0_33, plain, (X1=iminus8|X1=iplus8|~cTorF(X1))).
% 2.02/0.63 cnf(i_0_36, plain, (X1=iplus6|X1=iminus6|~cTorF(X1))).
% 2.02/0.63 cnf(i_0_39, plain, (X1=iplus9|X1=iminus9|~cTorF(X1))).
% 2.02/0.63 cnf(i_0_54, plain, (iminus9=iT|iplus3=iT|iminus2=iT)).
% 2.02/0.63 cnf(i_0_79, plain, (iplus9=iT|iplus6=iT|iminus2=iT)).
% 2.02/0.63 cnf(i_0_62, plain, (iplus8=iT|iminus5=iT|iplus7=iT)).
% 2.02/0.63 cnf(i_0_43, plain, (iplus8=iT|iminus3=iT|iplus7=iT)).
% 2.02/0.63 cnf(i_0_44, plain, (iplus9=iT|iplus5=iT|iminus7=iT)).
% 2.02/0.63 cnf(i_0_72, plain, (iplus8=iT|iplus3=iT|iminus7=iT)).
% 2.02/0.63 cnf(i_0_75, plain, (iplus6=iT|iminus8=iT|iminus7=iT)).
% 2.02/0.63 cnf(i_0_42, plain, (iplus9=iT|iminus6=iT|iminus7=iT)).
% 2.02/0.63 cnf(i_0_77, plain, (iminus8=iT|iminus3=iT|iplus5=iT)).
% 2.02/0.63 cnf(i_0_82, plain, (iminus9=iT|iplus3=iT|iminus5=iT)).
% 2.02/0.63 cnf(i_0_73, plain, (iminus8=iT|iminus3=iT|iminus5=iT)).
% 2.02/0.63 cnf(i_0_71, plain, (iplus9=iT|iminus8=iT|iplus3=iT)).
% 2.02/0.63 cnf(i_0_7657, plain, (X26=X26)).
% 2.02/0.63 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 2.02/0.63 # Begin printing tableau
% 2.02/0.63 # Found 6 steps
% 2.02/0.63 cnf(i_0_7657, plain, (iplus1=iplus1), inference(start_rule)).
% 2.02/0.63 cnf(i_0_7856, plain, (iplus1=iplus1), inference(extension_rule, [i_0_7661])).
% 2.02/0.63 cnf(i_0_8035, plain, (~cTorF(iplus1)), inference(closure_rule, [i_0_11])).
% 2.02/0.63 cnf(i_0_8033, plain, (cTorF(iplus1)), inference(extension_rule, [i_0_15])).
% 2.02/0.63 cnf(i_0_8178, plain, (iplus4=iplus1), inference(etableau_closure_rule, [i_0_8178, ...])).
% 2.02/0.63 cnf(i_0_8179, plain, (iplus1=iminus4), inference(etableau_closure_rule, [i_0_8179, ...])).
% 2.02/0.63 # End printing tableau
% 2.02/0.63 # SZS output end
% 2.02/0.63 # Branches closed with saturation will be marked with an "s"
% 2.02/0.63 # Child (1204) has found a proof.
% 2.02/0.63
% 2.02/0.63 # Proof search is over...
% 2.02/0.63 # Freeing feature tree
%------------------------------------------------------------------------------