TSTP Solution File: KRS033+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KRS033+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 : n027.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:22 EDT 2022
% Result : Satisfiable 3.55s 0.84s
% Output : CNFRefutation 3.55s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : KRS033+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n027.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 : Tue Jun 7 19:37:10 EDT 2022
% 0.12/0.33 % 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: 50 Number of unprocessed: 50
% 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 # 50 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 50 start rule candidates:
% 0.12/0.38 # Found 2 unit axioms.
% 0.12/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.38 # 50 start rule tableaux created.
% 0.12/0.38 # 48 extension rule candidate clauses
% 0.12/0.38 # 2 unit axiom clauses
% 0.12/0.38
% 0.12/0.38 # Requested 8, 32 cores available to the main process.
% 3.55/0.83 # 15014 Satisfiable branch
% 3.55/0.84 # Satisfiable branch found.
% 3.55/0.84 # There were 1 total branch saturation attempts.
% 3.55/0.84 # There were 0 of these attempts blocked.
% 3.55/0.84 # There were 0 deferred branch saturation attempts.
% 3.55/0.84 # There were 0 free duplicated saturations.
% 3.55/0.84 # There were 0 total successful branch saturations.
% 3.55/0.84 # There were 0 successful branch saturations in interreduction.
% 3.55/0.84 # There were 0 successful branch saturations on the branch.
% 3.55/0.84 # There were 0 successful branch saturations after the branch.
% 3.55/0.84 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.55/0.84 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.55/0.84 # Begin clausification derivation
% 3.55/0.84
% 3.55/0.84 # End clausification derivation
% 3.55/0.84 # Begin listing active clauses obtained from FOF to CNF conversion
% 3.55/0.84 cnf(i_0_64, plain, (cSatisfiable(i2003_11_14_17_15_37698))).
% 3.55/0.84 cnf(i_0_14, plain, (~cowlNothing(X1))).
% 3.55/0.84 cnf(i_0_55, plain, (~cp2(X1)|~cp1(X1))).
% 3.55/0.84 cnf(i_0_56, plain, (~cp3(X1)|~cp1(X1))).
% 3.55/0.84 cnf(i_0_57, plain, (~cp4(X1)|~cp1(X1))).
% 3.55/0.84 cnf(i_0_16, plain, (xsd_string(X1)|xsd_integer(X1))).
% 3.55/0.84 cnf(i_0_51, plain, (cp(esk1_1(X1))|~cSatisfiable(X1))).
% 3.55/0.84 cnf(i_0_54, plain, (~cp5(X1)|~cp1(X1))).
% 3.55/0.84 cnf(i_0_59, plain, (~cp3(X1)|~cp2(X1))).
% 3.55/0.84 cnf(i_0_60, plain, (~cp4(X1)|~cp2(X1))).
% 3.55/0.84 cnf(i_0_58, plain, (~cp5(X1)|~cp2(X1))).
% 3.55/0.84 cnf(i_0_62, plain, (~cp4(X1)|~cp3(X1))).
% 3.55/0.84 cnf(i_0_61, plain, (~cp5(X1)|~cp3(X1))).
% 3.55/0.84 cnf(i_0_63, plain, (~cp5(X1)|~cp4(X1))).
% 3.55/0.84 cnf(i_0_17, plain, (~xsd_string(X1)|~xsd_integer(X1))).
% 3.55/0.84 cnf(i_0_48, plain, (cp(esk2_1(X1))|~cSatisfiable(X1))).
% 3.55/0.84 cnf(i_0_46, plain, (cp(esk3_1(X1))|~cSatisfiable(X1))).
% 3.55/0.84 cnf(i_0_35, plain, (cp(esk7_1(X1))|~cSatisfiable(X1))).
% 3.55/0.84 cnf(i_0_45, plain, (cp1(esk3_1(X1))|~cSatisfiable(X1))).
% 3.55/0.84 cnf(i_0_38, plain, (cp1(esk6_1(X1))|~cSatisfiable(X1))).
% 3.55/0.84 cnf(i_0_49, plain, (cp2(esk2_1(X1))|~cSatisfiable(X1))).
% 3.55/0.84 cnf(i_0_33, plain, (cp2(esk8_1(X1))|~cSatisfiable(X1))).
% 3.55/0.84 cnf(i_0_52, plain, (cp3(esk1_1(X1))|~cSatisfiable(X1))).
% 3.55/0.84 cnf(i_0_40, plain, (cp3(esk5_1(X1))|~cSatisfiable(X1))).
% 3.55/0.84 cnf(i_0_42, plain, (cp4(esk4_1(X1))|~cSatisfiable(X1))).
% 3.55/0.84 cnf(i_0_36, plain, (cp4(esk7_1(X1))|~cSatisfiable(X1))).
% 3.55/0.84 cnf(i_0_53, plain, (rr(X1,esk1_1(X1))|~cSatisfiable(X1))).
% 3.55/0.84 cnf(i_0_50, plain, (rr(X1,esk2_1(X1))|~cSatisfiable(X1))).
% 3.55/0.84 cnf(i_0_47, plain, (rr(X1,esk3_1(X1))|~cSatisfiable(X1))).
% 3.55/0.84 cnf(i_0_43, plain, (rr(X1,esk4_1(X1))|~cSatisfiable(X1))).
% 3.55/0.84 cnf(i_0_41, plain, (rr(X1,esk5_1(X1))|~cSatisfiable(X1))).
% 3.55/0.84 cnf(i_0_39, plain, (rr(X1,esk6_1(X1))|~cSatisfiable(X1))).
% 3.55/0.84 cnf(i_0_37, plain, (rr(X1,esk7_1(X1))|~cSatisfiable(X1))).
% 3.55/0.84 cnf(i_0_34, plain, (rr(X1,esk8_1(X1))|~cSatisfiable(X1))).
% 3.55/0.84 cnf(i_0_44, plain, (X1=X2|X1=X3|X1=X4|X1=X5|X2=X3|X2=X4|X2=X5|X3=X4|X3=X5|X4=X5|~rr(X6,X5)|~rr(X6,X4)|~rr(X6,X3)|~rr(X6,X2)|~rr(X6,X1)|~cSatisfiable(X6))).
% 3.55/0.84 cnf(i_0_27, plain, (cSatisfiable(X1)|esk10_1(X1)!=esk9_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~cp4(X3)|~cp4(X6)|~cp3(X5)|~cp3(X9)|~cp2(X2)|~cp2(X8)|~cp1(X4)|~cp1(X7)|~cp(X3)|~cp(X7)|~cp(X8)|~cp(X9))).
% 3.55/0.84 cnf(i_0_26, plain, (cSatisfiable(X1)|esk11_1(X1)!=esk9_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~cp4(X3)|~cp4(X6)|~cp3(X5)|~cp3(X9)|~cp2(X2)|~cp2(X8)|~cp1(X4)|~cp1(X7)|~cp(X3)|~cp(X7)|~cp(X8)|~cp(X9))).
% 3.55/0.84 cnf(i_0_23, plain, (cSatisfiable(X1)|esk11_1(X1)!=esk10_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~cp4(X3)|~cp4(X6)|~cp3(X5)|~cp3(X9)|~cp2(X2)|~cp2(X8)|~cp1(X4)|~cp1(X7)|~cp(X3)|~cp(X7)|~cp(X8)|~cp(X9))).
% 3.55/0.84 cnf(i_0_25, plain, (cSatisfiable(X1)|esk12_1(X1)!=esk9_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~cp4(X3)|~cp4(X6)|~cp3(X5)|~cp3(X9)|~cp2(X2)|~cp2(X8)|~cp1(X4)|~cp1(X7)|~cp(X3)|~cp(X7)|~cp(X8)|~cp(X9))).
% 3.55/0.84 cnf(i_0_22, plain, (cSatisfiable(X1)|esk12_1(X1)!=esk10_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~cp4(X3)|~cp4(X6)|~cp3(X5)|~cp3(X9)|~cp2(X2)|~cp2(X8)|~cp1(X4)|~cp1(X7)|~cp(X3)|~cp(X7)|~cp(X8)|~cp(X9))).
% 3.55/0.84 cnf(i_0_20, plain, (cSatisfiable(X1)|esk12_1(X1)!=esk11_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~cp4(X3)|~cp4(X6)|~cp3(X5)|~cp3(X9)|~cp2(X2)|~cp2(X8)|~cp1(X4)|~cp1(X7)|~cp(X3)|~cp(X7)|~cp(X8)|~cp(X9))).
% 3.55/0.84 cnf(i_0_24, plain, (cSatisfiable(X1)|esk13_1(X1)!=esk9_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~cp4(X3)|~cp4(X6)|~cp3(X5)|~cp3(X9)|~cp2(X2)|~cp2(X8)|~cp1(X4)|~cp1(X7)|~cp(X3)|~cp(X7)|~cp(X8)|~cp(X9))).
% 3.55/0.84 cnf(i_0_21, plain, (cSatisfiable(X1)|esk13_1(X1)!=esk10_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~cp4(X3)|~cp4(X6)|~cp3(X5)|~cp3(X9)|~cp2(X2)|~cp2(X8)|~cp1(X4)|~cp1(X7)|~cp(X3)|~cp(X7)|~cp(X8)|~cp(X9))).
% 3.55/0.84 cnf(i_0_19, plain, (cSatisfiable(X1)|esk13_1(X1)!=esk11_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~cp4(X3)|~cp4(X6)|~cp3(X5)|~cp3(X9)|~cp2(X2)|~cp2(X8)|~cp1(X4)|~cp1(X7)|~cp(X3)|~cp(X7)|~cp(X8)|~cp(X9))).
% 3.55/0.84 cnf(i_0_18, plain, (cSatisfiable(X1)|esk13_1(X1)!=esk12_1(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~cp4(X3)|~cp4(X6)|~cp3(X5)|~cp3(X9)|~cp2(X2)|~cp2(X8)|~cp1(X4)|~cp1(X7)|~cp(X3)|~cp(X7)|~cp(X8)|~cp(X9))).
% 3.55/0.84 cnf(i_0_32, plain, (rr(X1,esk9_1(X1))|cSatisfiable(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~cp4(X3)|~cp4(X6)|~cp3(X5)|~cp3(X9)|~cp2(X2)|~cp2(X8)|~cp1(X4)|~cp1(X7)|~cp(X3)|~cp(X7)|~cp(X8)|~cp(X9))).
% 3.55/0.84 cnf(i_0_31, plain, (rr(X1,esk10_1(X1))|cSatisfiable(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~cp4(X3)|~cp4(X6)|~cp3(X5)|~cp3(X9)|~cp2(X2)|~cp2(X8)|~cp1(X4)|~cp1(X7)|~cp(X3)|~cp(X7)|~cp(X8)|~cp(X9))).
% 3.55/0.84 cnf(i_0_30, plain, (rr(X1,esk11_1(X1))|cSatisfiable(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~cp4(X3)|~cp4(X6)|~cp3(X5)|~cp3(X9)|~cp2(X2)|~cp2(X8)|~cp1(X4)|~cp1(X7)|~cp(X3)|~cp(X7)|~cp(X8)|~cp(X9))).
% 3.55/0.84 cnf(i_0_29, plain, (rr(X1,esk12_1(X1))|cSatisfiable(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~cp4(X3)|~cp4(X6)|~cp3(X5)|~cp3(X9)|~cp2(X2)|~cp2(X8)|~cp1(X4)|~cp1(X7)|~cp(X3)|~cp(X7)|~cp(X8)|~cp(X9))).
% 3.55/0.84 cnf(i_0_28, plain, (rr(X1,esk13_1(X1))|cSatisfiable(X1)|~rr(X1,X2)|~rr(X1,X3)|~rr(X1,X4)|~rr(X1,X5)|~rr(X1,X6)|~rr(X1,X7)|~rr(X1,X8)|~rr(X1,X9)|~cp4(X3)|~cp4(X6)|~cp3(X5)|~cp3(X9)|~cp2(X2)|~cp2(X8)|~cp1(X4)|~cp1(X7)|~cp(X3)|~cp(X7)|~cp(X8)|~cp(X9))).
% 3.55/0.84 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 3.55/0.84 # Begin printing tableau
% 3.55/0.84 # Found 7 steps
% 3.55/0.84 cnf(i_0_48, plain, (cp(esk2_1(i2003_11_14_17_15_37698))|~cSatisfiable(i2003_11_14_17_15_37698)), inference(start_rule)).
% 3.55/0.84 cnf(i_0_94, plain, (~cSatisfiable(i2003_11_14_17_15_37698)), inference(closure_rule, [i_0_64])).
% 3.55/0.84 cnf(i_0_93, plain, (cp(esk2_1(i2003_11_14_17_15_37698))), inference(extension_rule, [i_0_27])).
% 3.55/0.84 cnf(i_0_986, plain, (~cp(esk2_1(i2003_11_14_17_15_37698))), inference(closure_rule, [i_0_93])).
% 3.55/0.84 cnf(i_0_987, plain, (~cp(esk2_1(i2003_11_14_17_15_37698))), inference(closure_rule, [i_0_93])).
% 3.55/0.84 cnf(i_0_988, plain, (~cp(esk2_1(i2003_11_14_17_15_37698))), inference(closure_rule, [i_0_93])).
% 3.55/0.84 cnf(i_0_967, plain, (cSatisfiable(X2)), inference(extension_rule, [i_0_51])).
% 3.55/0.84 # End printing tableau
% 3.55/0.84 # SZS output end
% 3.55/0.84 # Branches closed with saturation will be marked with an "s"
% 3.55/0.84 # Child (15014) has found a proof.
% 3.55/0.84
% 3.55/0.84 # Proof search is over...
% 3.55/0.84 # Freeing feature tree
%------------------------------------------------------------------------------