TSTP Solution File: KRS029+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KRS029+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 : n018.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 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS029+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/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.33 % Computer : n018.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 13:11:06 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_S032N
% 0.12/0.37 # and selection function SelectUnlessUniqMax.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 23 Number of unprocessed: 23
% 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.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 23 beginning clauses after preprocessing and clausification
% 0.12/0.37 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.12/0.37 # No conjectures.
% 0.12/0.37 # There are 23 start rule candidates:
% 0.12/0.37 # Found 2 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 23 start rule tableaux created.
% 0.12/0.37 # 21 extension rule candidate clauses
% 0.12/0.37 # 2 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # 32453 Satisfiable branch
% 0.12/0.37 # Satisfiable branch found.
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 0 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 0 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_38, plain, (cSatisfiable(i2003_11_14_17_15_22537))).
% 0.12/0.37 cnf(i_0_15, plain, (~cowlNothing(X1))).
% 0.12/0.37 cnf(i_0_29, plain, (~cp2(X1)|~cp1(X1))).
% 0.12/0.37 cnf(i_0_26, plain, (~cp3(X1)|~cp1(X1))).
% 0.12/0.37 cnf(i_0_27, plain, (~cp4(X1)|~cp1(X1))).
% 0.12/0.37 cnf(i_0_17, plain, (xsd_string(X1)|xsd_integer(X1))).
% 0.12/0.37 cnf(i_0_23, plain, (cp1(esk2_1(X1))|~cSatisfiable(X1))).
% 0.12/0.37 cnf(i_0_28, plain, (~cp5(X1)|~cp1(X1))).
% 0.12/0.37 cnf(i_0_30, plain, (~cp3(X1)|~cp2(X1))).
% 0.12/0.37 cnf(i_0_31, plain, (~cp4(X1)|~cp2(X1))).
% 0.12/0.37 cnf(i_0_32, plain, (~cp5(X1)|~cp2(X1))).
% 0.12/0.37 cnf(i_0_33, plain, (~cp4(X1)|~cp3(X1))).
% 0.12/0.37 cnf(i_0_34, plain, (~cp5(X1)|~cp3(X1))).
% 0.12/0.37 cnf(i_0_35, plain, (~cp5(X1)|~cp4(X1))).
% 0.12/0.37 cnf(i_0_18, plain, (~xsd_string(X1)|~xsd_integer(X1))).
% 0.12/0.37 cnf(i_0_37, plain, (rr(X1,X2)|~rinvR(X2,X1))).
% 0.12/0.37 cnf(i_0_25, plain, (rinvR(X1,esk1_1(X1))|~cSatisfiable(X1))).
% 0.12/0.37 cnf(i_0_36, plain, (rinvR(X1,X2)|~rr(X2,X1))).
% 0.12/0.37 cnf(i_0_24, plain, (rr(esk1_1(X1),esk2_1(X1))|~cSatisfiable(X1))).
% 0.12/0.37 cnf(i_0_22, plain, (X1=X2|~rr(esk1_1(X3),X2)|~rr(esk1_1(X3),X1)|~cSatisfiable(X3))).
% 0.12/0.37 cnf(i_0_19, plain, (cSatisfiable(X1)|esk4_2(X1,X2)!=esk3_2(X1,X2)|~rr(X2,X3)|~rinvR(X1,X2)|~cp1(X3))).
% 0.12/0.37 cnf(i_0_21, plain, (rr(X1,esk3_2(X2,X1))|cSatisfiable(X2)|~rr(X1,X3)|~rinvR(X2,X1)|~cp1(X3))).
% 0.12/0.37 cnf(i_0_20, plain, (rr(X1,esk4_2(X2,X1))|cSatisfiable(X2)|~rr(X1,X3)|~rinvR(X2,X1)|~cp1(X3))).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 3 steps
% 0.12/0.37 cnf(i_0_38, plain, (cSatisfiable(i2003_11_14_17_15_22537)), inference(start_rule)).
% 0.12/0.37 cnf(i_0_39, plain, (cSatisfiable(i2003_11_14_17_15_22537)), inference(extension_rule, [i_0_23])).
% 0.12/0.37 cnf(i_0_102, plain, (cp1(esk2_1(i2003_11_14_17_15_22537))), inference(extension_rule, [i_0_29])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # 32456 Satisfiable branch
% 0.12/0.37 # Child (32453) has found a proof.
% 0.12/0.37
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------