TSTP Solution File: LCL195-3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL195-3 : TPTP v8.1.0. Released v2.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 : n020.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 10:20:22 EDT 2022
% Result : Unsatisfiable 4.28s 4.49s
% Output : CNFRefutation 4.28s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL195-3 : TPTP v8.1.0. Released v2.3.0.
% 0.11/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 : n020.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 : Mon Jul 4 04:51:14 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 8 Number of unprocessed: 8
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.61/0.78 # The folding up rule is enabled...
% 0.61/0.78 # Local unification is enabled...
% 0.61/0.78 # Any saturation attempts will use folding labels...
% 0.61/0.78 # 8 beginning clauses after preprocessing and clausification
% 0.61/0.78 # Creating start rules for all 1 conjectures.
% 0.61/0.78 # There are 1 start rule candidates:
% 0.61/0.78 # Found 6 unit axioms.
% 0.61/0.78 # 1 start rule tableaux created.
% 0.61/0.78 # 2 extension rule candidate clauses
% 0.61/0.78 # 6 unit axiom clauses
% 0.61/0.78
% 0.61/0.78 # Requested 8, 32 cores available to the main process.
% 0.61/0.78 # There are not enough tableaux to fork, creating more from the initial 1
% 4.28/4.43 # Ran out of tableaux, making start rules for all clauses
% 4.28/4.43 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 4.28/4.43 # We now have 8 tableaux to operate on
% 4.28/4.49 # There were 8 total branch saturation attempts.
% 4.28/4.49 # There were 0 of these attempts blocked.
% 4.28/4.49 # There were 0 deferred branch saturation attempts.
% 4.28/4.49 # There were 0 free duplicated saturations.
% 4.28/4.49 # There were 1 total successful branch saturations.
% 4.28/4.49 # There were 0 successful branch saturations in interreduction.
% 4.28/4.49 # There were 0 successful branch saturations on the branch.
% 4.28/4.49 # There were 1 successful branch saturations after the branch.
% 4.28/4.49 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.28/4.49 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.28/4.49 # Begin clausification derivation
% 4.28/4.49
% 4.28/4.49 # End clausification derivation
% 4.28/4.49 # Begin listing active clauses obtained from FOF to CNF conversion
% 4.28/4.49 cnf(i_0_11, plain, (axiom(or(not(X1),or(X2,X1))))).
% 4.28/4.49 cnf(i_0_10, plain, (axiom(or(not(or(X1,X1)),X1)))).
% 4.28/4.49 cnf(i_0_12, plain, (axiom(or(not(or(X1,X2)),or(X2,X1))))).
% 4.28/4.49 cnf(i_0_13, plain, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))))).
% 4.28/4.49 cnf(i_0_14, plain, (axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))))).
% 4.28/4.49 cnf(i_0_18, negated_conjecture, (~theorem(or(not(or(not(q),r)),or(not(or(q,p)),or(r,p)))))).
% 4.28/4.49 cnf(i_0_16, plain, (theorem(X1)|~axiom(X1))).
% 4.28/4.49 cnf(i_0_17, plain, (theorem(X1)|~theorem(or(not(X2),X1))|~theorem(X2))).
% 4.28/4.49 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 4.28/4.49 # Begin printing tableau
% 4.28/4.49 # Found 8 steps
% 4.28/4.49 cnf(i_0_17, plain, (theorem(or(not(or(not(q),r)),or(not(or(q,p)),or(r,p))))|~theorem(or(not(or(or(not(or(not(q),r)),or(not(or(q,p)),or(r,p))),or(not(or(not(q),r)),or(not(or(q,p)),or(r,p))))),or(not(or(not(q),r)),or(not(or(q,p)),or(r,p)))))|~theorem(or(or(not(or(not(q),r)),or(not(or(q,p)),or(r,p))),or(not(or(not(q),r)),or(not(or(q,p)),or(r,p)))))), inference(start_rule)).
% 4.28/4.49 cnf(i_0_426894, plain, (theorem(or(not(or(not(q),r)),or(not(or(q,p)),or(r,p))))), inference(closure_rule, [i_0_18])).
% 4.28/4.49 cnf(i_0_426895, plain, (~theorem(or(not(or(or(not(or(not(q),r)),or(not(or(q,p)),or(r,p))),or(not(or(not(q),r)),or(not(or(q,p)),or(r,p))))),or(not(or(not(q),r)),or(not(or(q,p)),or(r,p)))))), inference(extension_rule, [i_0_16])).
% 4.28/4.49 cnf(i_0_426903, plain, (~axiom(or(not(or(or(not(or(not(q),r)),or(not(or(q,p)),or(r,p))),or(not(or(not(q),r)),or(not(or(q,p)),or(r,p))))),or(not(or(not(q),r)),or(not(or(q,p)),or(r,p)))))), inference(closure_rule, [i_0_10])).
% 4.28/4.49 cnf(i_0_426896, plain, (~theorem(or(or(not(or(not(q),r)),or(not(or(q,p)),or(r,p))),or(not(or(not(q),r)),or(not(or(q,p)),or(r,p)))))), inference(extension_rule, [i_0_17])).
% 4.28/4.49 cnf(i_0_426906, plain, (~theorem(or(not(or(or(not(or(not(q),r)),or(not(or(q,p)),or(r,p))),or(not(or(not(q),r)),or(not(or(q,p)),or(r,p))))),or(not(or(not(q),r)),or(not(or(q,p)),or(r,p)))))), inference(closure_rule, [i_0_426895])).
% 4.28/4.49 cnf(i_0_426905, plain, (~theorem(or(not(or(not(or(or(not(or(not(q),r)),or(not(or(q,p)),or(r,p))),or(not(or(not(q),r)),or(not(or(q,p)),or(r,p))))),or(not(or(not(q),r)),or(not(or(q,p)),or(r,p))))),or(or(not(or(not(q),r)),or(not(or(q,p)),or(r,p))),or(not(or(not(q),r)),or(not(or(q,p)),or(r,p))))))), inference(extension_rule, [i_0_16])).
% 4.28/4.49 cnf(i_0_426908, plain, (~axiom(or(not(or(not(or(or(not(or(not(q),r)),or(not(or(q,p)),or(r,p))),or(not(or(not(q),r)),or(not(or(q,p)),or(r,p))))),or(not(or(not(q),r)),or(not(or(q,p)),or(r,p))))),or(or(not(or(not(q),r)),or(not(or(q,p)),or(r,p))),or(not(or(not(q),r)),or(not(or(q,p)),or(r,p))))))), inference(etableau_closure_rule, [i_0_426908, ...])).
% 4.28/4.49 # End printing tableau
% 4.28/4.49 # SZS output end
% 4.28/4.49 # Branches closed with saturation will be marked with an "s"
% 4.34/4.50 # Child (25893) has found a proof.
% 4.34/4.50
% 4.34/4.50 # Proof search is over...
% 4.34/4.50 # Freeing feature tree
%------------------------------------------------------------------------------